java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:36:11,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:36:11,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:36:11,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:36:11,815 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:36:11,816 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:36:11,818 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:36:11,820 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:36:11,830 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:36:11,831 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:36:11,832 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:36:11,833 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:36:11,833 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:36:11,834 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:36:11,835 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:36:11,836 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:36:11,837 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:36:11,839 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:36:11,841 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:36:11,844 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:36:11,846 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:36:11,847 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:36:11,850 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:36:11,850 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:36:11,850 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:36:11,851 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:36:11,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:36:11,853 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:36:11,854 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:36:11,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:36:11,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:36:11,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:36:11,859 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:36:11,860 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:36:11,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:36:11,864 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:36:11,864 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:36:11,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:36:11,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:36:11,897 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:36:11,897 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:36:11,898 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:36:11,898 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:36:11,898 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:36:11,898 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:36:11,899 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:36:11,899 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:36:11,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:36:11,903 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:36:11,903 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:36:11,903 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:36:11,903 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:36:11,904 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:36:11,904 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:36:11,904 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:36:11,904 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:36:11,904 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:36:11,905 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:36:11,905 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:36:11,905 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:36:11,905 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:36:11,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:36:11,907 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:36:11,907 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:36:11,907 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:36:11,908 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:36:11,908 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:36:11,908 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:36:11,908 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:36:11,908 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:36:11,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:36:11,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:36:11,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:36:11,986 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:36:11,986 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:36:11,987 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+sep-reducer.c [2018-11-23 11:36:12,057 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9ecfcdc/84bf7d56d5b049f491330bd1a18f4dc7/FLAG0a73b4b52 [2018-11-23 11:36:12,735 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:36:12,736 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+sep-reducer.c [2018-11-23 11:36:12,772 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9ecfcdc/84bf7d56d5b049f491330bd1a18f4dc7/FLAG0a73b4b52 [2018-11-23 11:36:12,894 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9ecfcdc/84bf7d56d5b049f491330bd1a18f4dc7 [2018-11-23 11:36:12,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:36:12,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:36:12,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:36:12,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:36:12,912 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:36:12,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:12" (1/1) ... [2018-11-23 11:36:12,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7098ea53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:12, skipping insertion in model container [2018-11-23 11:36:12,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:12" (1/1) ... [2018-11-23 11:36:12,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:36:13,053 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:36:14,023 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:36:14,030 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:36:14,598 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:36:14,620 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:36:14,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:14 WrapperNode [2018-11-23 11:36:14,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:36:14,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:36:14,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:36:14,622 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:36:14,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:14" (1/1) ... [2018-11-23 11:36:14,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:14" (1/1) ... [2018-11-23 11:36:14,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:36:14,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:36:14,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:36:14,681 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:36:14,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:14" (1/1) ... [2018-11-23 11:36:14,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:14" (1/1) ... [2018-11-23 11:36:14,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:14" (1/1) ... [2018-11-23 11:36:14,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:14" (1/1) ... [2018-11-23 11:36:14,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:14" (1/1) ... [2018-11-23 11:36:14,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:14" (1/1) ... [2018-11-23 11:36:14,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:14" (1/1) ... [2018-11-23 11:36:14,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:36:14,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:36:14,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:36:14,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:36:14,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:36:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:36:14,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:36:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:36:14,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:36:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:36:14,963 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:36:20,546 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:36:20,547 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:36:20,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:20 BoogieIcfgContainer [2018-11-23 11:36:20,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:36:20,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:36:20,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:36:20,552 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:36:20,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:36:12" (1/3) ... [2018-11-23 11:36:20,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b97436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:20, skipping insertion in model container [2018-11-23 11:36:20,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:14" (2/3) ... [2018-11-23 11:36:20,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b97436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:20, skipping insertion in model container [2018-11-23 11:36:20,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:20" (3/3) ... [2018-11-23 11:36:20,557 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+sep-reducer.c [2018-11-23 11:36:20,567 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:36:20,575 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-23 11:36:20,592 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-23 11:36:20,632 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:36:20,633 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:36:20,633 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:36:20,633 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:36:20,634 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:36:20,634 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:36:20,634 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:36:20,634 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:36:20,634 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:36:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states. [2018-11-23 11:36:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:36:20,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:20,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:20,693 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:20,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:20,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1514750688, now seen corresponding path program 1 times [2018-11-23 11:36:20,707 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:20,707 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:20,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:20,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:21,016 INFO L256 TraceCheckUtils]: 0: Hoare triple {483#true} call ULTIMATE.init(); {483#true} is VALID [2018-11-23 11:36:21,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {483#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {483#true} is VALID [2018-11-23 11:36:21,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {483#true} assume true; {483#true} is VALID [2018-11-23 11:36:21,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {483#true} {483#true} #1914#return; {483#true} is VALID [2018-11-23 11:36:21,021 INFO L256 TraceCheckUtils]: 4: Hoare triple {483#true} call #t~ret75 := main(); {483#true} is VALID [2018-11-23 11:36:21,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {483#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {483#true} is VALID [2018-11-23 11:36:21,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {483#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {506#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:21,023 INFO L273 TraceCheckUtils]: 7: Hoare triple {506#(= (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {506#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:21,025 INFO L273 TraceCheckUtils]: 8: Hoare triple {506#(= (_ 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; {513#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:21,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {513#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {484#false} is VALID [2018-11-23 11:36:21,031 INFO L273 TraceCheckUtils]: 10: Hoare triple {484#false} assume !false; {484#false} is VALID [2018-11-23 11:36:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:21,035 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:21,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:21,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:36:21,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 11:36:21,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:21,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:36:21,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:21,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:36:21,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:36:21,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:36:21,120 INFO L87 Difference]: Start difference. First operand 480 states. Second operand 4 states. [2018-11-23 11:36:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:27,283 INFO L93 Difference]: Finished difference Result 496 states and 923 transitions. [2018-11-23 11:36:27,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:36:27,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 11:36:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 923 transitions. [2018-11-23 11:36:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 923 transitions. [2018-11-23 11:36:27,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 923 transitions. [2018-11-23 11:36:28,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 923 edges. 923 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:28,476 INFO L225 Difference]: With dead ends: 496 [2018-11-23 11:36:28,477 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 11:36:28,482 INFO L631 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-23 11:36:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 11:36:28,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2018-11-23 11:36:28,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:28,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 305 states. [2018-11-23 11:36:28,580 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 305 states. [2018-11-23 11:36:28,580 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 305 states. [2018-11-23 11:36:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:28,596 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2018-11-23 11:36:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 370 transitions. [2018-11-23 11:36:28,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:28,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:28,600 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 308 states. [2018-11-23 11:36:28,600 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 308 states. [2018-11-23 11:36:28,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:28,614 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2018-11-23 11:36:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 370 transitions. [2018-11-23 11:36:28,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:28,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:28,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:28,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 11:36:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 368 transitions. [2018-11-23 11:36:28,633 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 368 transitions. Word has length 11 [2018-11-23 11:36:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:28,633 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 368 transitions. [2018-11-23 11:36:28,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:36:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 368 transitions. [2018-11-23 11:36:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:36:28,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:28,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:28,635 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:28,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash 287371989, now seen corresponding path program 1 times [2018-11-23 11:36:28,636 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:28,636 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:28,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:28,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:28,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {1965#true} call ULTIMATE.init(); {1965#true} is VALID [2018-11-23 11:36:28,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {1965#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {1965#true} is VALID [2018-11-23 11:36:28,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {1965#true} assume true; {1965#true} is VALID [2018-11-23 11:36:28,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1965#true} {1965#true} #1914#return; {1965#true} is VALID [2018-11-23 11:36:28,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {1965#true} call #t~ret75 := main(); {1965#true} is VALID [2018-11-23 11:36:28,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {1965#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1965#true} is VALID [2018-11-23 11:36:28,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {1965#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {1988#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:28,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {1988#(= (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {1992#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:36:28,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {1992#(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; {1992#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:36:28,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {1992#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1999#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:28,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {1999#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {1966#false} is VALID [2018-11-23 11:36:28,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {1966#false} assume !false; {1966#false} is VALID [2018-11-23 11:36:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:28,816 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:28,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:28,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:28,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 11:36:28,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:28,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:28,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:28,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:28,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:28,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:28,874 INFO L87 Difference]: Start difference. First operand 305 states and 368 transitions. Second operand 5 states. [2018-11-23 11:36:31,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:31,600 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2018-11-23 11:36:31,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:31,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 11:36:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2018-11-23 11:36:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2018-11-23 11:36:31,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 370 transitions. [2018-11-23 11:36:32,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:32,047 INFO L225 Difference]: With dead ends: 308 [2018-11-23 11:36:32,047 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 11:36:32,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 11:36:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-11-23 11:36:32,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:32,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:32,123 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:32,123 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:32,135 INFO L93 Difference]: Finished difference Result 303 states and 365 transitions. [2018-11-23 11:36:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 365 transitions. [2018-11-23 11:36:32,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:32,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:32,137 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:32,137 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:32,149 INFO L93 Difference]: Finished difference Result 303 states and 365 transitions. [2018-11-23 11:36:32,149 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 365 transitions. [2018-11-23 11:36:32,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:32,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:32,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:32,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 11:36:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 365 transitions. [2018-11-23 11:36:32,161 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 365 transitions. Word has length 12 [2018-11-23 11:36:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:32,161 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 365 transitions. [2018-11-23 11:36:32,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 365 transitions. [2018-11-23 11:36:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:36:32,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:32,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:32,163 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:32,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:32,163 INFO L82 PathProgramCache]: Analyzing trace with hash 675123817, now seen corresponding path program 1 times [2018-11-23 11:36:32,164 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:32,164 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:32,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:32,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:32,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {3241#true} call ULTIMATE.init(); {3241#true} is VALID [2018-11-23 11:36:32,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {3241#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {3241#true} is VALID [2018-11-23 11:36:32,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {3241#true} assume true; {3241#true} is VALID [2018-11-23 11:36:32,353 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3241#true} {3241#true} #1914#return; {3241#true} is VALID [2018-11-23 11:36:32,353 INFO L256 TraceCheckUtils]: 4: Hoare triple {3241#true} call #t~ret75 := main(); {3241#true} is VALID [2018-11-23 11:36:32,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {3241#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3241#true} is VALID [2018-11-23 11:36:32,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {3241#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {3264#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:32,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {3264#(= (_ 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; {3264#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:32,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {3264#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {3264#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:32,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {3264#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {3264#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:32,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {3264#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {3277#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:32,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {3277#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {3277#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:32,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {3277#(= (_ 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; {3284#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:32,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {3284#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {3242#false} is VALID [2018-11-23 11:36:32,363 INFO L273 TraceCheckUtils]: 14: Hoare triple {3242#false} assume !false; {3242#false} is VALID [2018-11-23 11:36:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:32,365 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:32,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:32,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:32,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:32,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:32,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:32,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:32,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:32,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:32,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:32,391 INFO L87 Difference]: Start difference. First operand 303 states and 365 transitions. Second operand 5 states. [2018-11-23 11:36:35,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:35,766 INFO L93 Difference]: Finished difference Result 310 states and 371 transitions. [2018-11-23 11:36:35,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:35,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:35,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2018-11-23 11:36:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2018-11-23 11:36:35,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 371 transitions. [2018-11-23 11:36:36,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:36,216 INFO L225 Difference]: With dead ends: 310 [2018-11-23 11:36:36,216 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 11:36:36,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 11:36:36,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2018-11-23 11:36:36,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:36,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 305 states. [2018-11-23 11:36:36,252 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 305 states. [2018-11-23 11:36:36,253 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 305 states. [2018-11-23 11:36:36,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:36,263 INFO L93 Difference]: Finished difference Result 308 states and 369 transitions. [2018-11-23 11:36:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 369 transitions. [2018-11-23 11:36:36,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:36,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:36,264 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 308 states. [2018-11-23 11:36:36,264 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 308 states. [2018-11-23 11:36:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:36,275 INFO L93 Difference]: Finished difference Result 308 states and 369 transitions. [2018-11-23 11:36:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 369 transitions. [2018-11-23 11:36:36,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:36,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:36,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:36,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 11:36:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 367 transitions. [2018-11-23 11:36:36,286 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 367 transitions. Word has length 15 [2018-11-23 11:36:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:36,287 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 367 transitions. [2018-11-23 11:36:36,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 367 transitions. [2018-11-23 11:36:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:36:36,288 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:36,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:36,288 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:36,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:36,289 INFO L82 PathProgramCache]: Analyzing trace with hash -545995092, now seen corresponding path program 1 times [2018-11-23 11:36:36,289 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:36,289 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:36,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:36,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:36,529 INFO L256 TraceCheckUtils]: 0: Hoare triple {4541#true} call ULTIMATE.init(); {4541#true} is VALID [2018-11-23 11:36:36,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {4541#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {4541#true} is VALID [2018-11-23 11:36:36,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-23 11:36:36,531 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4541#true} {4541#true} #1914#return; {4541#true} is VALID [2018-11-23 11:36:36,531 INFO L256 TraceCheckUtils]: 4: Hoare triple {4541#true} call #t~ret75 := main(); {4541#true} is VALID [2018-11-23 11:36:36,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {4541#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4541#true} is VALID [2018-11-23 11:36:36,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {4541#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {4564#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:36,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {4564#(= (_ 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; {4564#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:36,536 INFO L273 TraceCheckUtils]: 8: Hoare triple {4564#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {4564#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:36,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {4564#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {4564#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:36,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {4564#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {4577#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:36,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {4577#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {4581#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:36,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {4581#(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; {4581#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:36,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {4581#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4588#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:36,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {4588#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {4542#false} is VALID [2018-11-23 11:36:36,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {4542#false} assume !false; {4542#false} is VALID [2018-11-23 11:36:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:36,548 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:36,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:36,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:36,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:36,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:36,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:36,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:36,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:36,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:36,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:36,576 INFO L87 Difference]: Start difference. First operand 305 states and 367 transitions. Second operand 6 states. [2018-11-23 11:36:39,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:39,500 INFO L93 Difference]: Finished difference Result 308 states and 369 transitions. [2018-11-23 11:36:39,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:39,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:39,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 369 transitions. [2018-11-23 11:36:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 369 transitions. [2018-11-23 11:36:39,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 369 transitions. [2018-11-23 11:36:40,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 369 edges. 369 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:40,538 INFO L225 Difference]: With dead ends: 308 [2018-11-23 11:36:40,538 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 11:36:40,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 11:36:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-11-23 11:36:40,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:40,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:40,647 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:40,647 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:40,656 INFO L93 Difference]: Finished difference Result 303 states and 364 transitions. [2018-11-23 11:36:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 364 transitions. [2018-11-23 11:36:40,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:40,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:40,657 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:40,657 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:40,666 INFO L93 Difference]: Finished difference Result 303 states and 364 transitions. [2018-11-23 11:36:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 364 transitions. [2018-11-23 11:36:40,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:40,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:40,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:40,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 11:36:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 364 transitions. [2018-11-23 11:36:40,678 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 364 transitions. Word has length 16 [2018-11-23 11:36:40,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:40,679 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 364 transitions. [2018-11-23 11:36:40,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 364 transitions. [2018-11-23 11:36:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:36:40,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:40,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:40,680 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:40,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:40,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1807720320, now seen corresponding path program 1 times [2018-11-23 11:36:40,681 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:40,681 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:40,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:40,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:40,887 INFO L256 TraceCheckUtils]: 0: Hoare triple {5830#true} call ULTIMATE.init(); {5830#true} is VALID [2018-11-23 11:36:40,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {5830#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {5830#true} is VALID [2018-11-23 11:36:40,888 INFO L273 TraceCheckUtils]: 2: Hoare triple {5830#true} assume true; {5830#true} is VALID [2018-11-23 11:36:40,888 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5830#true} {5830#true} #1914#return; {5830#true} is VALID [2018-11-23 11:36:40,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {5830#true} call #t~ret75 := main(); {5830#true} is VALID [2018-11-23 11:36:40,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {5830#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5830#true} is VALID [2018-11-23 11:36:40,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {5830#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {5853#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,892 INFO L273 TraceCheckUtils]: 7: Hoare triple {5853#(= (_ 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; {5853#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {5853#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {5853#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,898 INFO L273 TraceCheckUtils]: 9: Hoare triple {5853#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {5853#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {5853#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {5866#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {5866#(= (_ 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~nondet12;havoc #t~nondet12; {5866#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {5866#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {5866#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {5866#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {5866#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {5866#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {5879#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,906 INFO L273 TraceCheckUtils]: 15: Hoare triple {5879#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {5879#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {5879#(= (_ 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; {5886#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:40,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {5886#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {5831#false} is VALID [2018-11-23 11:36:40,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {5831#false} assume !false; {5831#false} is VALID [2018-11-23 11:36:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:40,908 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:40,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:40,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:40,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:36:40,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:40,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:40,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:40,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:40,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:40,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:40,935 INFO L87 Difference]: Start difference. First operand 303 states and 364 transitions. Second operand 6 states. [2018-11-23 11:36:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:45,125 INFO L93 Difference]: Finished difference Result 310 states and 370 transitions. [2018-11-23 11:36:45,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:45,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:36:45,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 370 transitions. [2018-11-23 11:36:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 370 transitions. [2018-11-23 11:36:45,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 370 transitions. [2018-11-23 11:36:48,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:48,839 INFO L225 Difference]: With dead ends: 310 [2018-11-23 11:36:48,839 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 11:36:48,839 INFO L631 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-23 11:36:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 11:36:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2018-11-23 11:36:48,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:48,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 305 states. [2018-11-23 11:36:48,865 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 305 states. [2018-11-23 11:36:48,865 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 305 states. [2018-11-23 11:36:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:48,874 INFO L93 Difference]: Finished difference Result 308 states and 368 transitions. [2018-11-23 11:36:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 368 transitions. [2018-11-23 11:36:48,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:48,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:48,875 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 308 states. [2018-11-23 11:36:48,875 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 308 states. [2018-11-23 11:36:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:48,885 INFO L93 Difference]: Finished difference Result 308 states and 368 transitions. [2018-11-23 11:36:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 368 transitions. [2018-11-23 11:36:48,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:48,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:48,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:48,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 11:36:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 366 transitions. [2018-11-23 11:36:48,894 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 366 transitions. Word has length 19 [2018-11-23 11:36:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:48,895 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 366 transitions. [2018-11-23 11:36:48,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 366 transitions. [2018-11-23 11:36:48,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:36:48,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:48,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:48,896 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:48,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:48,897 INFO L82 PathProgramCache]: Analyzing trace with hash -204752011, now seen corresponding path program 1 times [2018-11-23 11:36:48,897 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:48,897 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:48,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:49,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:49,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {7143#true} call ULTIMATE.init(); {7143#true} is VALID [2018-11-23 11:36:49,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {7143#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {7143#true} is VALID [2018-11-23 11:36:49,214 INFO L273 TraceCheckUtils]: 2: Hoare triple {7143#true} assume true; {7143#true} is VALID [2018-11-23 11:36:49,214 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7143#true} {7143#true} #1914#return; {7143#true} is VALID [2018-11-23 11:36:49,215 INFO L256 TraceCheckUtils]: 4: Hoare triple {7143#true} call #t~ret75 := main(); {7143#true} is VALID [2018-11-23 11:36:49,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {7143#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {7143#true} is VALID [2018-11-23 11:36:49,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {7143#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {7166#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {7166#(= (_ 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; {7166#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {7166#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {7166#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,217 INFO L273 TraceCheckUtils]: 9: Hoare triple {7166#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {7166#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {7166#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {7179#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {7179#(= (_ 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~nondet12;havoc #t~nondet12; {7179#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {7179#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {7179#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {7179#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {7179#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {7179#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {7192#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {7192#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {7196#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:36:49,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {7196#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7196#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:36:49,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {7196#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7203#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:49,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {7203#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {7144#false} is VALID [2018-11-23 11:36:49,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {7144#false} assume !false; {7144#false} is VALID [2018-11-23 11:36:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:49,226 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:49,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:49,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:36:49,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 11:36:49,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:49,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:36:49,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:49,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:36:49,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:36:49,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:49,254 INFO L87 Difference]: Start difference. First operand 305 states and 366 transitions. Second operand 7 states. [2018-11-23 11:36:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:53,092 INFO L93 Difference]: Finished difference Result 308 states and 368 transitions. [2018-11-23 11:36:53,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:36:53,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 11:36:53,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 368 transitions. [2018-11-23 11:36:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 368 transitions. [2018-11-23 11:36:53,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 368 transitions. [2018-11-23 11:36:53,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:53,922 INFO L225 Difference]: With dead ends: 308 [2018-11-23 11:36:53,923 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 11:36:53,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 11:36:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-11-23 11:36:53,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:53,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:53,958 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:53,958 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:53,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:53,967 INFO L93 Difference]: Finished difference Result 303 states and 363 transitions. [2018-11-23 11:36:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 363 transitions. [2018-11-23 11:36:53,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:53,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:53,968 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:53,968 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:36:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:53,976 INFO L93 Difference]: Finished difference Result 303 states and 363 transitions. [2018-11-23 11:36:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 363 transitions. [2018-11-23 11:36:53,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:53,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:53,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:53,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 11:36:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 363 transitions. [2018-11-23 11:36:53,985 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 363 transitions. Word has length 20 [2018-11-23 11:36:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:53,985 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 363 transitions. [2018-11-23 11:36:53,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:36:53,985 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 363 transitions. [2018-11-23 11:36:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:36:53,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:53,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:53,987 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:53,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:53,987 INFO L82 PathProgramCache]: Analyzing trace with hash 346719383, now seen corresponding path program 1 times [2018-11-23 11:36:53,987 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:53,987 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:54,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:54,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:54,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {8445#true} call ULTIMATE.init(); {8445#true} is VALID [2018-11-23 11:36:54,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {8445#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {8445#true} is VALID [2018-11-23 11:36:54,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {8445#true} assume true; {8445#true} is VALID [2018-11-23 11:36:54,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8445#true} {8445#true} #1914#return; {8445#true} is VALID [2018-11-23 11:36:54,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {8445#true} call #t~ret75 := main(); {8445#true} is VALID [2018-11-23 11:36:54,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {8445#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {8445#true} is VALID [2018-11-23 11:36:54,252 INFO L273 TraceCheckUtils]: 6: Hoare triple {8445#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {8468#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {8468#(= (_ 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; {8468#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {8468#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {8468#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {8468#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {8468#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,253 INFO L273 TraceCheckUtils]: 10: Hoare triple {8468#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8481#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {8481#(= (_ 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~nondet12;havoc #t~nondet12; {8481#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {8481#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {8481#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {8481#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {8481#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {8481#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8494#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {8494#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {8494#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {8494#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {8494#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {8494#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {8494#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {8494#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8507#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {8507#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {8507#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {8507#(= (_ bv3 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8514#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:54,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {8514#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {8446#false} is VALID [2018-11-23 11:36:54,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {8446#false} assume !false; {8446#false} is VALID [2018-11-23 11:36:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:54,267 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:54,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:54,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:36:54,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 11:36:54,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:54,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:36:54,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:54,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:36:54,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:36:54,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:54,298 INFO L87 Difference]: Start difference. First operand 303 states and 363 transitions. Second operand 7 states. [2018-11-23 11:36:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:59,046 INFO L93 Difference]: Finished difference Result 310 states and 369 transitions. [2018-11-23 11:36:59,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:36:59,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 11:36:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:59,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 369 transitions. [2018-11-23 11:36:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 369 transitions. [2018-11-23 11:36:59,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 369 transitions. [2018-11-23 11:36:59,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 369 edges. 369 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:59,887 INFO L225 Difference]: With dead ends: 310 [2018-11-23 11:36:59,887 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 11:36:59,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:59,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 11:36:59,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2018-11-23 11:36:59,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:59,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 305 states. [2018-11-23 11:36:59,921 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 305 states. [2018-11-23 11:36:59,921 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 305 states. [2018-11-23 11:36:59,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:59,932 INFO L93 Difference]: Finished difference Result 308 states and 367 transitions. [2018-11-23 11:36:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 367 transitions. [2018-11-23 11:36:59,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:59,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:59,934 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 308 states. [2018-11-23 11:36:59,934 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 308 states. [2018-11-23 11:36:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:59,942 INFO L93 Difference]: Finished difference Result 308 states and 367 transitions. [2018-11-23 11:36:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 367 transitions. [2018-11-23 11:36:59,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:59,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:59,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:59,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 11:36:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 365 transitions. [2018-11-23 11:36:59,952 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 365 transitions. Word has length 23 [2018-11-23 11:36:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:59,952 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 365 transitions. [2018-11-23 11:36:59,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:36:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 365 transitions. [2018-11-23 11:36:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:36:59,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:59,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:59,954 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:59,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:59,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2136597954, now seen corresponding path program 1 times [2018-11-23 11:36:59,954 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:59,955 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:59,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:00,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:00,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {9771#true} call ULTIMATE.init(); {9771#true} is VALID [2018-11-23 11:37:00,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {9771#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {9771#true} is VALID [2018-11-23 11:37:00,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {9771#true} assume true; {9771#true} is VALID [2018-11-23 11:37:00,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9771#true} {9771#true} #1914#return; {9771#true} is VALID [2018-11-23 11:37:00,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {9771#true} call #t~ret75 := main(); {9771#true} is VALID [2018-11-23 11:37:00,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {9771#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {9771#true} is VALID [2018-11-23 11:37:00,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {9771#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {9794#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {9794#(= (_ 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; {9794#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {9794#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {9794#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {9794#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {9794#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {9794#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {9807#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,590 INFO L273 TraceCheckUtils]: 11: Hoare triple {9807#(= (_ 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~nondet12;havoc #t~nondet12; {9807#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {9807#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {9807#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,594 INFO L273 TraceCheckUtils]: 13: Hoare triple {9807#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {9807#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {9807#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {9820#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {9820#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {9820#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {9820#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {9820#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,596 INFO L273 TraceCheckUtils]: 17: Hoare triple {9820#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {9820#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,596 INFO L273 TraceCheckUtils]: 18: Hoare triple {9820#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {9833#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,597 INFO L273 TraceCheckUtils]: 19: Hoare triple {9833#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {9837#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-23 11:37:00,597 INFO L273 TraceCheckUtils]: 20: Hoare triple {9837#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9837#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-23 11:37:00,599 INFO L273 TraceCheckUtils]: 21: Hoare triple {9837#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9844#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:00,599 INFO L273 TraceCheckUtils]: 22: Hoare triple {9844#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {9772#false} is VALID [2018-11-23 11:37:00,599 INFO L273 TraceCheckUtils]: 23: Hoare triple {9772#false} assume !false; {9772#false} is VALID [2018-11-23 11:37:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:00,601 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:00,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:00,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:37:00,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-23 11:37:00,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:00,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:37:00,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:00,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:37:00,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:37:00,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:00,645 INFO L87 Difference]: Start difference. First operand 305 states and 365 transitions. Second operand 8 states. [2018-11-23 11:37:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:05,386 INFO L93 Difference]: Finished difference Result 308 states and 367 transitions. [2018-11-23 11:37:05,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:37:05,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-23 11:37:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 367 transitions. [2018-11-23 11:37:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 367 transitions. [2018-11-23 11:37:05,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 367 transitions. [2018-11-23 11:37:05,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:05,786 INFO L225 Difference]: With dead ends: 308 [2018-11-23 11:37:05,786 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 11:37:05,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 11:37:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-11-23 11:37:05,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:05,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:05,817 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:05,817 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:05,824 INFO L93 Difference]: Finished difference Result 303 states and 362 transitions. [2018-11-23 11:37:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 362 transitions. [2018-11-23 11:37:05,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:05,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:05,825 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:05,825 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:05,832 INFO L93 Difference]: Finished difference Result 303 states and 362 transitions. [2018-11-23 11:37:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 362 transitions. [2018-11-23 11:37:05,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:05,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:05,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:05,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:05,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 11:37:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 362 transitions. [2018-11-23 11:37:05,840 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 362 transitions. Word has length 24 [2018-11-23 11:37:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:05,840 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 362 transitions. [2018-11-23 11:37:05,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:37:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 362 transitions. [2018-11-23 11:37:05,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:37:05,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:05,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:05,842 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:05,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:05,842 INFO L82 PathProgramCache]: Analyzing trace with hash -639566162, now seen corresponding path program 1 times [2018-11-23 11:37:05,842 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:05,842 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:05,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:05,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:06,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {11086#true} call ULTIMATE.init(); {11086#true} is VALID [2018-11-23 11:37:06,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {11086#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {11086#true} is VALID [2018-11-23 11:37:06,105 INFO L273 TraceCheckUtils]: 2: Hoare triple {11086#true} assume true; {11086#true} is VALID [2018-11-23 11:37:06,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11086#true} {11086#true} #1914#return; {11086#true} is VALID [2018-11-23 11:37:06,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {11086#true} call #t~ret75 := main(); {11086#true} is VALID [2018-11-23 11:37:06,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {11086#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {11086#true} is VALID [2018-11-23 11:37:06,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {11086#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {11109#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {11109#(= (_ 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; {11109#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {11109#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {11109#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {11109#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {11109#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {11109#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11122#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,109 INFO L273 TraceCheckUtils]: 11: Hoare triple {11122#(= (_ 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~nondet12;havoc #t~nondet12; {11122#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,109 INFO L273 TraceCheckUtils]: 12: Hoare triple {11122#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {11122#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,109 INFO L273 TraceCheckUtils]: 13: Hoare triple {11122#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {11122#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {11122#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11135#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,111 INFO L273 TraceCheckUtils]: 15: Hoare triple {11135#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {11135#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {11135#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {11135#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {11135#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {11135#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,112 INFO L273 TraceCheckUtils]: 18: Hoare triple {11135#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11148#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {11148#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {11148#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {11148#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {11148#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {11148#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {11148#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {11148#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11161#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,116 INFO L273 TraceCheckUtils]: 23: Hoare triple {11161#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {11161#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,117 INFO L273 TraceCheckUtils]: 24: Hoare triple {11161#(= (_ bv4 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11168#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:06,117 INFO L273 TraceCheckUtils]: 25: Hoare triple {11168#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {11087#false} is VALID [2018-11-23 11:37:06,118 INFO L273 TraceCheckUtils]: 26: Hoare triple {11087#false} assume !false; {11087#false} is VALID [2018-11-23 11:37:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:06,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:06,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:06,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:37:06,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:37:06,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:06,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:37:06,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:06,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:37:06,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:37:06,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:06,159 INFO L87 Difference]: Start difference. First operand 303 states and 362 transitions. Second operand 8 states. [2018-11-23 11:37:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:11,862 INFO L93 Difference]: Finished difference Result 310 states and 368 transitions. [2018-11-23 11:37:11,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:37:11,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:37:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 368 transitions. [2018-11-23 11:37:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 368 transitions. [2018-11-23 11:37:11,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 368 transitions. [2018-11-23 11:37:12,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:12,458 INFO L225 Difference]: With dead ends: 310 [2018-11-23 11:37:12,458 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 11:37:12,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 11:37:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2018-11-23 11:37:12,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:12,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 305 states. [2018-11-23 11:37:12,508 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 305 states. [2018-11-23 11:37:12,508 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 305 states. [2018-11-23 11:37:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:12,514 INFO L93 Difference]: Finished difference Result 308 states and 366 transitions. [2018-11-23 11:37:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 366 transitions. [2018-11-23 11:37:12,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:12,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:12,515 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 308 states. [2018-11-23 11:37:12,515 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 308 states. [2018-11-23 11:37:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:12,522 INFO L93 Difference]: Finished difference Result 308 states and 366 transitions. [2018-11-23 11:37:12,522 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 366 transitions. [2018-11-23 11:37:12,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:12,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:12,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:12,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 11:37:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 364 transitions. [2018-11-23 11:37:12,530 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 364 transitions. Word has length 27 [2018-11-23 11:37:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:12,531 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 364 transitions. [2018-11-23 11:37:12,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:37:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 364 transitions. [2018-11-23 11:37:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:37:12,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:12,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:12,532 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:12,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:12,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1648288519, now seen corresponding path program 1 times [2018-11-23 11:37:12,533 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:12,533 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:12,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:12,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:12,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {12425#true} call ULTIMATE.init(); {12425#true} is VALID [2018-11-23 11:37:12,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {12425#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {12425#true} is VALID [2018-11-23 11:37:12,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {12425#true} assume true; {12425#true} is VALID [2018-11-23 11:37:12,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12425#true} {12425#true} #1914#return; {12425#true} is VALID [2018-11-23 11:37:12,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {12425#true} call #t~ret75 := main(); {12425#true} is VALID [2018-11-23 11:37:12,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {12425#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {12425#true} is VALID [2018-11-23 11:37:12,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {12425#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {12448#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {12448#(= (_ 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; {12448#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {12448#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {12448#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {12448#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {12448#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {12448#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {12461#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {12461#(= (_ 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~nondet12;havoc #t~nondet12; {12461#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {12461#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {12461#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,816 INFO L273 TraceCheckUtils]: 13: Hoare triple {12461#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {12461#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {12461#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {12474#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {12474#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {12474#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {12474#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {12474#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {12474#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {12474#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {12474#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {12487#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {12487#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {12487#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {12487#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {12487#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {12487#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {12487#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {12487#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {12500#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {12500#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {12504#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:12,831 INFO L273 TraceCheckUtils]: 24: Hoare triple {12504#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12504#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:12,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {12504#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {12511#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:12,832 INFO L273 TraceCheckUtils]: 26: Hoare triple {12511#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {12426#false} is VALID [2018-11-23 11:37:12,833 INFO L273 TraceCheckUtils]: 27: Hoare triple {12426#false} assume !false; {12426#false} is VALID [2018-11-23 11:37:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:12,837 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:12,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:12,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:37:12,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 11:37:12,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:12,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:37:12,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:12,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:37:12,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:37:12,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:12,877 INFO L87 Difference]: Start difference. First operand 305 states and 364 transitions. Second operand 9 states. [2018-11-23 11:37:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:18,497 INFO L93 Difference]: Finished difference Result 308 states and 366 transitions. [2018-11-23 11:37:18,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:37:18,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 11:37:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 366 transitions. [2018-11-23 11:37:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 366 transitions. [2018-11-23 11:37:18,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 366 transitions. [2018-11-23 11:37:18,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 366 edges. 366 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:18,881 INFO L225 Difference]: With dead ends: 308 [2018-11-23 11:37:18,882 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 11:37:18,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 11:37:18,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-11-23 11:37:18,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:18,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:18,983 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:18,983 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:18,991 INFO L93 Difference]: Finished difference Result 303 states and 361 transitions. [2018-11-23 11:37:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 361 transitions. [2018-11-23 11:37:18,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:18,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:18,992 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:18,992 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:19,001 INFO L93 Difference]: Finished difference Result 303 states and 361 transitions. [2018-11-23 11:37:19,001 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 361 transitions. [2018-11-23 11:37:19,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:19,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:19,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:19,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 11:37:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 361 transitions. [2018-11-23 11:37:19,009 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 361 transitions. Word has length 28 [2018-11-23 11:37:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:19,010 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 361 transitions. [2018-11-23 11:37:19,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:37:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 361 transitions. [2018-11-23 11:37:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:37:19,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:19,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:19,011 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:19,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1506332357, now seen corresponding path program 1 times [2018-11-23 11:37:19,013 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:19,014 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:19,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:19,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:19,283 INFO L256 TraceCheckUtils]: 0: Hoare triple {13753#true} call ULTIMATE.init(); {13753#true} is VALID [2018-11-23 11:37:19,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {13753#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {13753#true} is VALID [2018-11-23 11:37:19,284 INFO L273 TraceCheckUtils]: 2: Hoare triple {13753#true} assume true; {13753#true} is VALID [2018-11-23 11:37:19,284 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13753#true} {13753#true} #1914#return; {13753#true} is VALID [2018-11-23 11:37:19,284 INFO L256 TraceCheckUtils]: 4: Hoare triple {13753#true} call #t~ret75 := main(); {13753#true} is VALID [2018-11-23 11:37:19,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {13753#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {13753#true} is VALID [2018-11-23 11:37:19,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {13753#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {13776#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {13776#(= (_ 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; {13776#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,301 INFO L273 TraceCheckUtils]: 8: Hoare triple {13776#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {13776#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {13776#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {13776#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {13776#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {13789#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {13789#(= (_ 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~nondet12;havoc #t~nondet12; {13789#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {13789#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {13789#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {13789#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {13789#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,305 INFO L273 TraceCheckUtils]: 14: Hoare triple {13789#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {13802#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {13802#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {13802#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {13802#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {13802#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {13802#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {13802#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,307 INFO L273 TraceCheckUtils]: 18: Hoare triple {13802#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {13815#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {13815#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {13815#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,308 INFO L273 TraceCheckUtils]: 20: Hoare triple {13815#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {13815#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,308 INFO L273 TraceCheckUtils]: 21: Hoare triple {13815#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {13815#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {13815#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {13828#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,311 INFO L273 TraceCheckUtils]: 23: Hoare triple {13828#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {13828#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {13828#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {13828#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,314 INFO L273 TraceCheckUtils]: 25: Hoare triple {13828#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {13828#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,314 INFO L273 TraceCheckUtils]: 26: Hoare triple {13828#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {13841#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,315 INFO L273 TraceCheckUtils]: 27: Hoare triple {13841#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {13841#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:19,316 INFO L273 TraceCheckUtils]: 28: Hoare triple {13841#(= (_ bv5 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13848#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:19,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {13848#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {13754#false} is VALID [2018-11-23 11:37:19,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {13754#false} assume !false; {13754#false} is VALID [2018-11-23 11:37:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:19,318 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:19,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:19,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:37:19,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:37:19,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:19,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:37:19,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:19,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:37:19,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:37:19,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:19,359 INFO L87 Difference]: Start difference. First operand 303 states and 361 transitions. Second operand 9 states. [2018-11-23 11:37:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:25,836 INFO L93 Difference]: Finished difference Result 310 states and 367 transitions. [2018-11-23 11:37:25,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:37:25,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:37:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 367 transitions. [2018-11-23 11:37:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 367 transitions. [2018-11-23 11:37:25,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 367 transitions. [2018-11-23 11:37:26,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:26,227 INFO L225 Difference]: With dead ends: 310 [2018-11-23 11:37:26,227 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 11:37:26,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 11:37:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2018-11-23 11:37:26,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:26,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 305 states. [2018-11-23 11:37:26,249 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 305 states. [2018-11-23 11:37:26,249 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 305 states. [2018-11-23 11:37:26,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:26,257 INFO L93 Difference]: Finished difference Result 308 states and 365 transitions. [2018-11-23 11:37:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 365 transitions. [2018-11-23 11:37:26,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:26,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:26,258 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 308 states. [2018-11-23 11:37:26,258 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 308 states. [2018-11-23 11:37:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:26,265 INFO L93 Difference]: Finished difference Result 308 states and 365 transitions. [2018-11-23 11:37:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 365 transitions. [2018-11-23 11:37:26,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:26,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:26,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:26,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 11:37:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 363 transitions. [2018-11-23 11:37:26,273 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 363 transitions. Word has length 31 [2018-11-23 11:37:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:26,273 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 363 transitions. [2018-11-23 11:37:26,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:37:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 363 transitions. [2018-11-23 11:37:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:37:26,274 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:26,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:26,274 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:26,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:26,275 INFO L82 PathProgramCache]: Analyzing trace with hash -548334128, now seen corresponding path program 1 times [2018-11-23 11:37:26,275 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:26,275 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:26,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:26,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:26,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {15105#true} call ULTIMATE.init(); {15105#true} is VALID [2018-11-23 11:37:26,528 INFO L273 TraceCheckUtils]: 1: Hoare triple {15105#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {15105#true} is VALID [2018-11-23 11:37:26,528 INFO L273 TraceCheckUtils]: 2: Hoare triple {15105#true} assume true; {15105#true} is VALID [2018-11-23 11:37:26,528 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15105#true} {15105#true} #1914#return; {15105#true} is VALID [2018-11-23 11:37:26,528 INFO L256 TraceCheckUtils]: 4: Hoare triple {15105#true} call #t~ret75 := main(); {15105#true} is VALID [2018-11-23 11:37:26,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {15105#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {15105#true} is VALID [2018-11-23 11:37:26,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {15105#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {15128#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {15128#(= (_ 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; {15128#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {15128#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {15128#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {15128#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {15128#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {15128#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {15141#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {15141#(= (_ 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~nondet12;havoc #t~nondet12; {15141#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,531 INFO L273 TraceCheckUtils]: 12: Hoare triple {15141#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {15141#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,531 INFO L273 TraceCheckUtils]: 13: Hoare triple {15141#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {15141#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,532 INFO L273 TraceCheckUtils]: 14: Hoare triple {15141#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {15154#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,532 INFO L273 TraceCheckUtils]: 15: Hoare triple {15154#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {15154#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {15154#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {15154#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {15154#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {15154#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,544 INFO L273 TraceCheckUtils]: 18: Hoare triple {15154#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {15167#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {15167#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {15167#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {15167#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {15167#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,550 INFO L273 TraceCheckUtils]: 21: Hoare triple {15167#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {15167#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {15167#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {15180#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,551 INFO L273 TraceCheckUtils]: 23: Hoare triple {15180#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {15180#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,552 INFO L273 TraceCheckUtils]: 24: Hoare triple {15180#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {15180#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,553 INFO L273 TraceCheckUtils]: 25: Hoare triple {15180#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {15180#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,553 INFO L273 TraceCheckUtils]: 26: Hoare triple {15180#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {15193#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:26,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {15193#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {15197#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:26,556 INFO L273 TraceCheckUtils]: 28: Hoare triple {15197#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15197#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:26,561 INFO L273 TraceCheckUtils]: 29: Hoare triple {15197#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {15204#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:26,563 INFO L273 TraceCheckUtils]: 30: Hoare triple {15204#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {15106#false} is VALID [2018-11-23 11:37:26,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {15106#false} assume !false; {15106#false} is VALID [2018-11-23 11:37:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:26,564 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:26,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:26,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:37:26,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 11:37:26,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:26,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:26,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:26,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:26,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:26,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:26,634 INFO L87 Difference]: Start difference. First operand 305 states and 363 transitions. Second operand 10 states. [2018-11-23 11:37:33,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:33,232 INFO L93 Difference]: Finished difference Result 308 states and 365 transitions. [2018-11-23 11:37:33,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:37:33,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 11:37:33,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 365 transitions. [2018-11-23 11:37:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 365 transitions. [2018-11-23 11:37:33,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 365 transitions. [2018-11-23 11:37:33,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:33,637 INFO L225 Difference]: With dead ends: 308 [2018-11-23 11:37:33,637 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 11:37:33,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:37:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 11:37:33,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-11-23 11:37:33,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:33,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:33,646 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:33,647 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:33,653 INFO L93 Difference]: Finished difference Result 303 states and 360 transitions. [2018-11-23 11:37:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 360 transitions. [2018-11-23 11:37:33,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:33,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:33,654 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:33,654 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:33,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:33,661 INFO L93 Difference]: Finished difference Result 303 states and 360 transitions. [2018-11-23 11:37:33,661 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 360 transitions. [2018-11-23 11:37:33,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:33,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:33,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:33,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 11:37:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 360 transitions. [2018-11-23 11:37:33,668 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 360 transitions. Word has length 32 [2018-11-23 11:37:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:33,669 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 360 transitions. [2018-11-23 11:37:33,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 360 transitions. [2018-11-23 11:37:33,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:37:33,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:33,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:33,670 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:33,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:33,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1882786596, now seen corresponding path program 1 times [2018-11-23 11:37:33,671 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:33,671 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:33,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:33,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:33,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {16446#true} call ULTIMATE.init(); {16446#true} is VALID [2018-11-23 11:37:33,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {16446#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {16446#true} is VALID [2018-11-23 11:37:33,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {16446#true} assume true; {16446#true} is VALID [2018-11-23 11:37:33,924 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16446#true} {16446#true} #1914#return; {16446#true} is VALID [2018-11-23 11:37:33,924 INFO L256 TraceCheckUtils]: 4: Hoare triple {16446#true} call #t~ret75 := main(); {16446#true} is VALID [2018-11-23 11:37:33,924 INFO L273 TraceCheckUtils]: 5: Hoare triple {16446#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {16446#true} is VALID [2018-11-23 11:37:33,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {16446#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {16469#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {16469#(= (_ 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; {16469#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {16469#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {16469#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {16469#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {16469#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,927 INFO L273 TraceCheckUtils]: 10: Hoare triple {16469#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {16482#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,928 INFO L273 TraceCheckUtils]: 11: Hoare triple {16482#(= (_ 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~nondet12;havoc #t~nondet12; {16482#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,928 INFO L273 TraceCheckUtils]: 12: Hoare triple {16482#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {16482#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,929 INFO L273 TraceCheckUtils]: 13: Hoare triple {16482#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {16482#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,929 INFO L273 TraceCheckUtils]: 14: Hoare triple {16482#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {16495#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,930 INFO L273 TraceCheckUtils]: 15: Hoare triple {16495#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {16495#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,930 INFO L273 TraceCheckUtils]: 16: Hoare triple {16495#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {16495#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,931 INFO L273 TraceCheckUtils]: 17: Hoare triple {16495#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {16495#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,932 INFO L273 TraceCheckUtils]: 18: Hoare triple {16495#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {16508#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,932 INFO L273 TraceCheckUtils]: 19: Hoare triple {16508#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {16508#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,933 INFO L273 TraceCheckUtils]: 20: Hoare triple {16508#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {16508#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,933 INFO L273 TraceCheckUtils]: 21: Hoare triple {16508#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {16508#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,934 INFO L273 TraceCheckUtils]: 22: Hoare triple {16508#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {16521#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,934 INFO L273 TraceCheckUtils]: 23: Hoare triple {16521#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {16521#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,935 INFO L273 TraceCheckUtils]: 24: Hoare triple {16521#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {16521#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,936 INFO L273 TraceCheckUtils]: 25: Hoare triple {16521#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {16521#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {16521#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {16534#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,937 INFO L273 TraceCheckUtils]: 27: Hoare triple {16534#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet16;havoc #t~nondet16; {16534#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,937 INFO L273 TraceCheckUtils]: 28: Hoare triple {16534#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_55~0;~__tmp_55~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {16534#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,947 INFO L273 TraceCheckUtils]: 29: Hoare triple {16534#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {16534#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,948 INFO L273 TraceCheckUtils]: 30: Hoare triple {16534#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {16547#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {16547#(= (_ bv6 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {16547#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:37:33,949 INFO L273 TraceCheckUtils]: 32: Hoare triple {16547#(= (_ bv6 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {16554#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:33,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {16554#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {16447#false} is VALID [2018-11-23 11:37:33,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {16447#false} assume !false; {16447#false} is VALID [2018-11-23 11:37:33,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-23 11:37:33,951 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:33,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:33,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:37:33,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 11:37:33,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:33,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:33,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:33,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:33,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:33,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:33,999 INFO L87 Difference]: Start difference. First operand 303 states and 360 transitions. Second operand 10 states. [2018-11-23 11:37:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:41,574 INFO L93 Difference]: Finished difference Result 310 states and 366 transitions. [2018-11-23 11:37:41,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:37:41,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 11:37:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 366 transitions. [2018-11-23 11:37:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 366 transitions. [2018-11-23 11:37:41,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 366 transitions. [2018-11-23 11:37:41,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 366 edges. 366 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:41,968 INFO L225 Difference]: With dead ends: 310 [2018-11-23 11:37:41,969 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 11:37:41,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:37:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 11:37:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2018-11-23 11:37:41,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:41,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 305 states. [2018-11-23 11:37:41,980 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 305 states. [2018-11-23 11:37:41,980 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 305 states. [2018-11-23 11:37:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:41,986 INFO L93 Difference]: Finished difference Result 308 states and 364 transitions. [2018-11-23 11:37:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 364 transitions. [2018-11-23 11:37:41,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:41,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:41,987 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 308 states. [2018-11-23 11:37:41,987 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 308 states. [2018-11-23 11:37:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:41,994 INFO L93 Difference]: Finished difference Result 308 states and 364 transitions. [2018-11-23 11:37:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 364 transitions. [2018-11-23 11:37:41,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:41,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:41,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:41,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 11:37:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 362 transitions. [2018-11-23 11:37:42,002 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 362 transitions. Word has length 35 [2018-11-23 11:37:42,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:42,002 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 362 transitions. [2018-11-23 11:37:42,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 362 transitions. [2018-11-23 11:37:42,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:37:42,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:42,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:42,004 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:42,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:42,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1763160729, now seen corresponding path program 1 times [2018-11-23 11:37:42,004 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:42,005 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:42,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:42,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:42,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {17811#true} call ULTIMATE.init(); {17811#true} is VALID [2018-11-23 11:37:42,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {17811#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {17811#true} is VALID [2018-11-23 11:37:42,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {17811#true} assume true; {17811#true} is VALID [2018-11-23 11:37:42,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17811#true} {17811#true} #1914#return; {17811#true} is VALID [2018-11-23 11:37:42,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {17811#true} call #t~ret75 := main(); {17811#true} is VALID [2018-11-23 11:37:42,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {17811#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {17811#true} is VALID [2018-11-23 11:37:42,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {17811#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {17834#(= (_ 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; {17834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {17834#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {17834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {17834#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {17834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {17834#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,332 INFO L273 TraceCheckUtils]: 11: Hoare triple {17847#(= (_ 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~nondet12;havoc #t~nondet12; {17847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {17847#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {17847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {17847#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {17847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {17847#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {17860#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {17860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {17860#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {17860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {17860#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {17860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {17860#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,336 INFO L273 TraceCheckUtils]: 19: Hoare triple {17873#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {17873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,337 INFO L273 TraceCheckUtils]: 20: Hoare triple {17873#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {17873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,337 INFO L273 TraceCheckUtils]: 21: Hoare triple {17873#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {17873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,338 INFO L273 TraceCheckUtils]: 22: Hoare triple {17873#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17886#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,339 INFO L273 TraceCheckUtils]: 23: Hoare triple {17886#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {17886#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,339 INFO L273 TraceCheckUtils]: 24: Hoare triple {17886#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {17886#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,340 INFO L273 TraceCheckUtils]: 25: Hoare triple {17886#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {17886#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,340 INFO L273 TraceCheckUtils]: 26: Hoare triple {17886#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17899#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {17899#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet16;havoc #t~nondet16; {17899#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,349 INFO L273 TraceCheckUtils]: 28: Hoare triple {17899#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_55~0;~__tmp_55~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {17899#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,350 INFO L273 TraceCheckUtils]: 29: Hoare triple {17899#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {17899#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,350 INFO L273 TraceCheckUtils]: 30: Hoare triple {17899#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17912#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:37:42,351 INFO L273 TraceCheckUtils]: 31: Hoare triple {17912#(= (_ bv6 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {17916#(and (= (_ bv6 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:42,351 INFO L273 TraceCheckUtils]: 32: Hoare triple {17916#(and (= (_ bv6 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; {17916#(and (= (_ bv6 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:42,352 INFO L273 TraceCheckUtils]: 33: Hoare triple {17916#(and (= (_ bv6 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {17923#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:42,352 INFO L273 TraceCheckUtils]: 34: Hoare triple {17923#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {17812#false} is VALID [2018-11-23 11:37:42,352 INFO L273 TraceCheckUtils]: 35: Hoare triple {17812#false} assume !false; {17812#false} is VALID [2018-11-23 11:37:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:42,353 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:42,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:42,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 11:37:42,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-23 11:37:42,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:42,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:37:42,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:42,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:37:42,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:37:42,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:37:42,401 INFO L87 Difference]: Start difference. First operand 305 states and 362 transitions. Second operand 11 states. [2018-11-23 11:37:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:49,834 INFO L93 Difference]: Finished difference Result 308 states and 364 transitions. [2018-11-23 11:37:49,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:37:49,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-23 11:37:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:37:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 364 transitions. [2018-11-23 11:37:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:37:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 364 transitions. [2018-11-23 11:37:49,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 364 transitions. [2018-11-23 11:37:50,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 364 edges. 364 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:50,220 INFO L225 Difference]: With dead ends: 308 [2018-11-23 11:37:50,220 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 11:37:50,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:37:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 11:37:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-11-23 11:37:50,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:50,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:50,246 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:50,246 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:50,252 INFO L93 Difference]: Finished difference Result 303 states and 359 transitions. [2018-11-23 11:37:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 359 transitions. [2018-11-23 11:37:50,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:50,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:50,253 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:50,254 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:37:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:50,259 INFO L93 Difference]: Finished difference Result 303 states and 359 transitions. [2018-11-23 11:37:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 359 transitions. [2018-11-23 11:37:50,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:50,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:50,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:50,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 11:37:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 359 transitions. [2018-11-23 11:37:50,266 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 359 transitions. Word has length 36 [2018-11-23 11:37:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:50,267 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 359 transitions. [2018-11-23 11:37:50,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:37:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 359 transitions. [2018-11-23 11:37:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:37:50,268 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:50,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:50,268 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:50,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:50,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1019244787, now seen corresponding path program 1 times [2018-11-23 11:37:50,269 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:50,269 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:50,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:50,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:50,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {19165#true} call ULTIMATE.init(); {19165#true} is VALID [2018-11-23 11:37:50,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {19165#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {19165#true} is VALID [2018-11-23 11:37:50,537 INFO L273 TraceCheckUtils]: 2: Hoare triple {19165#true} assume true; {19165#true} is VALID [2018-11-23 11:37:50,537 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19165#true} {19165#true} #1914#return; {19165#true} is VALID [2018-11-23 11:37:50,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {19165#true} call #t~ret75 := main(); {19165#true} is VALID [2018-11-23 11:37:50,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {19165#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {19165#true} is VALID [2018-11-23 11:37:50,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {19165#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {19188#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {19188#(= (_ 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; {19188#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {19188#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {19188#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {19188#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {19188#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {19188#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19201#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {19201#(= (_ 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~nondet12;havoc #t~nondet12; {19201#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {19201#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {19201#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {19201#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {19201#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {19201#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19214#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,542 INFO L273 TraceCheckUtils]: 15: Hoare triple {19214#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {19214#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {19214#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {19214#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {19214#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {19214#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,544 INFO L273 TraceCheckUtils]: 18: Hoare triple {19214#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19227#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,544 INFO L273 TraceCheckUtils]: 19: Hoare triple {19227#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {19227#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,545 INFO L273 TraceCheckUtils]: 20: Hoare triple {19227#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {19227#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,545 INFO L273 TraceCheckUtils]: 21: Hoare triple {19227#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {19227#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,546 INFO L273 TraceCheckUtils]: 22: Hoare triple {19227#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19240#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {19240#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {19240#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {19240#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {19240#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,548 INFO L273 TraceCheckUtils]: 25: Hoare triple {19240#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {19240#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,548 INFO L273 TraceCheckUtils]: 26: Hoare triple {19240#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19253#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {19253#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet16;havoc #t~nondet16; {19253#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,549 INFO L273 TraceCheckUtils]: 28: Hoare triple {19253#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_55~0;~__tmp_55~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {19253#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,550 INFO L273 TraceCheckUtils]: 29: Hoare triple {19253#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {19253#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,555 INFO L273 TraceCheckUtils]: 30: Hoare triple {19253#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19266#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,555 INFO L273 TraceCheckUtils]: 31: Hoare triple {19266#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;~main____CPAchecker_TMP_0~6 := #t~nondet17;havoc #t~nondet17; {19266#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,556 INFO L273 TraceCheckUtils]: 32: Hoare triple {19266#(= (_ bv6 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_59~0;~__tmp_59~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~58;~__VERIFIER_assert__cond~58 := ~__tmp_59~0; {19266#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,556 INFO L273 TraceCheckUtils]: 33: Hoare triple {19266#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~58);havoc ~__tmp_60~0;~__tmp_60~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~59;~__VERIFIER_assert__cond~59 := ~__tmp_60~0; {19266#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,556 INFO L273 TraceCheckUtils]: 34: Hoare triple {19266#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~59);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19279#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,557 INFO L273 TraceCheckUtils]: 35: Hoare triple {19279#(= (_ bv7 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {19279#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:37:50,557 INFO L273 TraceCheckUtils]: 36: Hoare triple {19279#(= (_ bv7 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; {19286#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:50,558 INFO L273 TraceCheckUtils]: 37: Hoare triple {19286#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {19166#false} is VALID [2018-11-23 11:37:50,558 INFO L273 TraceCheckUtils]: 38: Hoare triple {19166#false} assume !false; {19166#false} is VALID [2018-11-23 11:37:50,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:50,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:50,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:50,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 11:37:50,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-11-23 11:37:50,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:50,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:37:50,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:50,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:37:50,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:37:50,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:37:50,629 INFO L87 Difference]: Start difference. First operand 303 states and 359 transitions. Second operand 11 states. [2018-11-23 11:37:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:59,008 INFO L93 Difference]: Finished difference Result 310 states and 365 transitions. [2018-11-23 11:37:59,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:37:59,008 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-11-23 11:37:59,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:37:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 365 transitions. [2018-11-23 11:37:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:37:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 365 transitions. [2018-11-23 11:37:59,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 365 transitions. [2018-11-23 11:37:59,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:59,399 INFO L225 Difference]: With dead ends: 310 [2018-11-23 11:37:59,400 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 11:37:59,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:37:59,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 11:37:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2018-11-23 11:37:59,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:59,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 305 states. [2018-11-23 11:37:59,407 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 305 states. [2018-11-23 11:37:59,408 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 305 states. [2018-11-23 11:37:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:59,414 INFO L93 Difference]: Finished difference Result 308 states and 363 transitions. [2018-11-23 11:37:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 363 transitions. [2018-11-23 11:37:59,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:59,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:59,415 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 308 states. [2018-11-23 11:37:59,415 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 308 states. [2018-11-23 11:37:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:59,422 INFO L93 Difference]: Finished difference Result 308 states and 363 transitions. [2018-11-23 11:37:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 363 transitions. [2018-11-23 11:37:59,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:59,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:59,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:59,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 11:37:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 361 transitions. [2018-11-23 11:37:59,430 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 361 transitions. Word has length 39 [2018-11-23 11:37:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:59,430 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 361 transitions. [2018-11-23 11:37:59,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:37:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 361 transitions. [2018-11-23 11:37:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:37:59,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:59,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:59,431 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:59,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1531820386, now seen corresponding path program 1 times [2018-11-23 11:37:59,432 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:59,432 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:59,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:59,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:59,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {20543#true} call ULTIMATE.init(); {20543#true} is VALID [2018-11-23 11:37:59,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {20543#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {20543#true} is VALID [2018-11-23 11:37:59,734 INFO L273 TraceCheckUtils]: 2: Hoare triple {20543#true} assume true; {20543#true} is VALID [2018-11-23 11:37:59,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20543#true} {20543#true} #1914#return; {20543#true} is VALID [2018-11-23 11:37:59,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {20543#true} call #t~ret75 := main(); {20543#true} is VALID [2018-11-23 11:37:59,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {20543#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {20543#true} is VALID [2018-11-23 11:37:59,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {20543#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {20566#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {20566#(= (_ 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; {20566#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {20566#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {20566#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {20566#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {20566#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {20566#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20579#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {20579#(= (_ 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~nondet12;havoc #t~nondet12; {20579#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,739 INFO L273 TraceCheckUtils]: 12: Hoare triple {20579#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {20579#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {20579#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {20579#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {20579#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20592#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,741 INFO L273 TraceCheckUtils]: 15: Hoare triple {20592#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {20592#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {20592#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {20592#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {20592#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {20592#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,745 INFO L273 TraceCheckUtils]: 18: Hoare triple {20592#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20605#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {20605#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {20605#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,746 INFO L273 TraceCheckUtils]: 20: Hoare triple {20605#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {20605#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,746 INFO L273 TraceCheckUtils]: 21: Hoare triple {20605#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {20605#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {20605#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20618#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,747 INFO L273 TraceCheckUtils]: 23: Hoare triple {20618#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {20618#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {20618#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {20618#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,748 INFO L273 TraceCheckUtils]: 25: Hoare triple {20618#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {20618#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {20618#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20631#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,749 INFO L273 TraceCheckUtils]: 27: Hoare triple {20631#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet16;havoc #t~nondet16; {20631#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,750 INFO L273 TraceCheckUtils]: 28: Hoare triple {20631#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_55~0;~__tmp_55~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {20631#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,750 INFO L273 TraceCheckUtils]: 29: Hoare triple {20631#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {20631#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,751 INFO L273 TraceCheckUtils]: 30: Hoare triple {20631#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20644#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,751 INFO L273 TraceCheckUtils]: 31: Hoare triple {20644#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;~main____CPAchecker_TMP_0~6 := #t~nondet17;havoc #t~nondet17; {20644#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,752 INFO L273 TraceCheckUtils]: 32: Hoare triple {20644#(= (_ bv6 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_59~0;~__tmp_59~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~58;~__VERIFIER_assert__cond~58 := ~__tmp_59~0; {20644#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,752 INFO L273 TraceCheckUtils]: 33: Hoare triple {20644#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~58);havoc ~__tmp_60~0;~__tmp_60~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~59;~__VERIFIER_assert__cond~59 := ~__tmp_60~0; {20644#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,753 INFO L273 TraceCheckUtils]: 34: Hoare triple {20644#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~59);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20657#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:37:59,754 INFO L273 TraceCheckUtils]: 35: Hoare triple {20657#(= (_ bv7 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {20661#(and (= (_ bv7 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:59,754 INFO L273 TraceCheckUtils]: 36: Hoare triple {20661#(and (= (_ bv7 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; {20661#(and (= (_ bv7 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:59,755 INFO L273 TraceCheckUtils]: 37: Hoare triple {20661#(and (= (_ bv7 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {20668#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:59,756 INFO L273 TraceCheckUtils]: 38: Hoare triple {20668#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {20544#false} is VALID [2018-11-23 11:37:59,756 INFO L273 TraceCheckUtils]: 39: Hoare triple {20544#false} assume !false; {20544#false} is VALID [2018-11-23 11:37:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:59,758 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:59,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:59,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 11:37:59,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-23 11:37:59,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:59,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:37:59,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:59,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:37:59,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:37:59,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:37:59,813 INFO L87 Difference]: Start difference. First operand 305 states and 361 transitions. Second operand 12 states. [2018-11-23 11:38:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:07,982 INFO L93 Difference]: Finished difference Result 308 states and 363 transitions. [2018-11-23 11:38:07,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:38:07,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-23 11:38:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:07,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 363 transitions. [2018-11-23 11:38:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 363 transitions. [2018-11-23 11:38:07,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 363 transitions. [2018-11-23 11:38:08,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:08,373 INFO L225 Difference]: With dead ends: 308 [2018-11-23 11:38:08,373 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 11:38:08,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:38:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 11:38:08,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-11-23 11:38:08,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:08,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:08,393 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:08,393 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:08,399 INFO L93 Difference]: Finished difference Result 303 states and 358 transitions. [2018-11-23 11:38:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 358 transitions. [2018-11-23 11:38:08,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:08,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:08,399 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:08,399 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:08,406 INFO L93 Difference]: Finished difference Result 303 states and 358 transitions. [2018-11-23 11:38:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 358 transitions. [2018-11-23 11:38:08,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:08,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:08,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:08,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 11:38:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 358 transitions. [2018-11-23 11:38:08,414 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 358 transitions. Word has length 40 [2018-11-23 11:38:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:08,414 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 358 transitions. [2018-11-23 11:38:08,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:38:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 358 transitions. [2018-11-23 11:38:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:38:08,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:08,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:08,416 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:08,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:08,416 INFO L82 PathProgramCache]: Analyzing trace with hash 656032522, now seen corresponding path program 1 times [2018-11-23 11:38:08,416 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:08,416 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:08,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:08,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:08,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {21910#true} call ULTIMATE.init(); {21910#true} is VALID [2018-11-23 11:38:08,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {21910#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {21910#true} is VALID [2018-11-23 11:38:08,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {21910#true} assume true; {21910#true} is VALID [2018-11-23 11:38:08,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21910#true} {21910#true} #1914#return; {21910#true} is VALID [2018-11-23 11:38:08,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {21910#true} call #t~ret75 := main(); {21910#true} is VALID [2018-11-23 11:38:08,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {21910#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {21910#true} is VALID [2018-11-23 11:38:08,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {21910#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {21933#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {21933#(= (_ 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; {21933#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {21933#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {21933#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {21933#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {21933#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,902 INFO L273 TraceCheckUtils]: 10: Hoare triple {21933#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21946#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {21946#(= (_ 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~nondet12;havoc #t~nondet12; {21946#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {21946#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {21946#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {21946#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {21946#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {21946#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21959#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,904 INFO L273 TraceCheckUtils]: 15: Hoare triple {21959#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {21959#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {21959#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {21959#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {21959#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {21959#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {21959#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21972#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,905 INFO L273 TraceCheckUtils]: 19: Hoare triple {21972#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {21972#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,905 INFO L273 TraceCheckUtils]: 20: Hoare triple {21972#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {21972#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,906 INFO L273 TraceCheckUtils]: 21: Hoare triple {21972#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {21972#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,906 INFO L273 TraceCheckUtils]: 22: Hoare triple {21972#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21985#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,907 INFO L273 TraceCheckUtils]: 23: Hoare triple {21985#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {21985#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,907 INFO L273 TraceCheckUtils]: 24: Hoare triple {21985#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {21985#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,908 INFO L273 TraceCheckUtils]: 25: Hoare triple {21985#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {21985#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,908 INFO L273 TraceCheckUtils]: 26: Hoare triple {21985#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21998#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,909 INFO L273 TraceCheckUtils]: 27: Hoare triple {21998#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet16;havoc #t~nondet16; {21998#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,909 INFO L273 TraceCheckUtils]: 28: Hoare triple {21998#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_55~0;~__tmp_55~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {21998#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,910 INFO L273 TraceCheckUtils]: 29: Hoare triple {21998#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {21998#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,911 INFO L273 TraceCheckUtils]: 30: Hoare triple {21998#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22011#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,911 INFO L273 TraceCheckUtils]: 31: Hoare triple {22011#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;~main____CPAchecker_TMP_0~6 := #t~nondet17;havoc #t~nondet17; {22011#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,912 INFO L273 TraceCheckUtils]: 32: Hoare triple {22011#(= (_ bv6 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_59~0;~__tmp_59~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~58;~__VERIFIER_assert__cond~58 := ~__tmp_59~0; {22011#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,912 INFO L273 TraceCheckUtils]: 33: Hoare triple {22011#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~58);havoc ~__tmp_60~0;~__tmp_60~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~59;~__VERIFIER_assert__cond~59 := ~__tmp_60~0; {22011#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,913 INFO L273 TraceCheckUtils]: 34: Hoare triple {22011#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~59);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22024#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,913 INFO L273 TraceCheckUtils]: 35: Hoare triple {22024#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;~main____CPAchecker_TMP_0~7 := #t~nondet18;havoc #t~nondet18; {22024#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,914 INFO L273 TraceCheckUtils]: 36: Hoare triple {22024#(= (_ bv7 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_63~0;~__tmp_63~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~62;~__VERIFIER_assert__cond~62 := ~__tmp_63~0; {22024#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,914 INFO L273 TraceCheckUtils]: 37: Hoare triple {22024#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~62);havoc ~__tmp_64~0;~__tmp_64~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~63;~__VERIFIER_assert__cond~63 := ~__tmp_64~0; {22024#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,915 INFO L273 TraceCheckUtils]: 38: Hoare triple {22024#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~63);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22037#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,916 INFO L273 TraceCheckUtils]: 39: Hoare triple {22037#(= (_ bv8 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {22037#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:08,916 INFO L273 TraceCheckUtils]: 40: Hoare triple {22037#(= (_ bv8 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; {22044#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:08,917 INFO L273 TraceCheckUtils]: 41: Hoare triple {22044#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {21911#false} is VALID [2018-11-23 11:38:08,917 INFO L273 TraceCheckUtils]: 42: Hoare triple {21911#false} assume !false; {21911#false} is VALID [2018-11-23 11:38:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:08,920 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:08,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:08,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 11:38:08,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-11-23 11:38:08,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:08,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:38:08,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:08,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:38:08,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:38:08,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:08,980 INFO L87 Difference]: Start difference. First operand 303 states and 358 transitions. Second operand 12 states. [2018-11-23 11:38:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:18,078 INFO L93 Difference]: Finished difference Result 310 states and 364 transitions. [2018-11-23 11:38:18,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:38:18,078 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-11-23 11:38:18,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 364 transitions. [2018-11-23 11:38:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 364 transitions. [2018-11-23 11:38:18,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 364 transitions. [2018-11-23 11:38:18,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 364 edges. 364 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:18,479 INFO L225 Difference]: With dead ends: 310 [2018-11-23 11:38:18,480 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 11:38:18,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:38:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 11:38:18,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2018-11-23 11:38:18,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:18,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 305 states. [2018-11-23 11:38:18,493 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 305 states. [2018-11-23 11:38:18,493 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 305 states. [2018-11-23 11:38:18,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:18,498 INFO L93 Difference]: Finished difference Result 308 states and 362 transitions. [2018-11-23 11:38:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 362 transitions. [2018-11-23 11:38:18,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:18,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:18,499 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 308 states. [2018-11-23 11:38:18,499 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 308 states. [2018-11-23 11:38:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:18,511 INFO L93 Difference]: Finished difference Result 308 states and 362 transitions. [2018-11-23 11:38:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 362 transitions. [2018-11-23 11:38:18,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:18,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:18,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:18,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 11:38:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 360 transitions. [2018-11-23 11:38:18,519 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 360 transitions. Word has length 43 [2018-11-23 11:38:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:18,519 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 360 transitions. [2018-11-23 11:38:18,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:38:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 360 transitions. [2018-11-23 11:38:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:38:18,520 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:18,520 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:18,521 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:18,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:18,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1137825237, now seen corresponding path program 1 times [2018-11-23 11:38:18,521 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:18,521 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:18,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:18,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:19,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {23301#true} call ULTIMATE.init(); {23301#true} is VALID [2018-11-23 11:38:19,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {23301#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {23301#true} is VALID [2018-11-23 11:38:19,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {23301#true} assume true; {23301#true} is VALID [2018-11-23 11:38:19,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23301#true} {23301#true} #1914#return; {23301#true} is VALID [2018-11-23 11:38:19,081 INFO L256 TraceCheckUtils]: 4: Hoare triple {23301#true} call #t~ret75 := main(); {23301#true} is VALID [2018-11-23 11:38:19,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {23301#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {23301#true} is VALID [2018-11-23 11:38:19,082 INFO L273 TraceCheckUtils]: 6: Hoare triple {23301#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {23324#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,082 INFO L273 TraceCheckUtils]: 7: Hoare triple {23324#(= (_ 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; {23324#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,082 INFO L273 TraceCheckUtils]: 8: Hoare triple {23324#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {23324#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,083 INFO L273 TraceCheckUtils]: 9: Hoare triple {23324#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {23324#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {23324#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23337#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {23337#(= (_ 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~nondet12;havoc #t~nondet12; {23337#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {23337#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {23337#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {23337#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {23337#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,084 INFO L273 TraceCheckUtils]: 14: Hoare triple {23337#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23350#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {23350#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {23350#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,085 INFO L273 TraceCheckUtils]: 16: Hoare triple {23350#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {23350#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,085 INFO L273 TraceCheckUtils]: 17: Hoare triple {23350#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {23350#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,086 INFO L273 TraceCheckUtils]: 18: Hoare triple {23350#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23363#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,087 INFO L273 TraceCheckUtils]: 19: Hoare triple {23363#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {23363#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,087 INFO L273 TraceCheckUtils]: 20: Hoare triple {23363#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {23363#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {23363#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {23363#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,088 INFO L273 TraceCheckUtils]: 22: Hoare triple {23363#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23376#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {23376#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {23376#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,089 INFO L273 TraceCheckUtils]: 24: Hoare triple {23376#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {23376#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {23376#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {23376#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,091 INFO L273 TraceCheckUtils]: 26: Hoare triple {23376#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23389#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,091 INFO L273 TraceCheckUtils]: 27: Hoare triple {23389#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet16;havoc #t~nondet16; {23389#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,092 INFO L273 TraceCheckUtils]: 28: Hoare triple {23389#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_55~0;~__tmp_55~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {23389#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,092 INFO L273 TraceCheckUtils]: 29: Hoare triple {23389#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {23389#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,093 INFO L273 TraceCheckUtils]: 30: Hoare triple {23389#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23402#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,093 INFO L273 TraceCheckUtils]: 31: Hoare triple {23402#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;~main____CPAchecker_TMP_0~6 := #t~nondet17;havoc #t~nondet17; {23402#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,094 INFO L273 TraceCheckUtils]: 32: Hoare triple {23402#(= (_ bv6 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_59~0;~__tmp_59~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~58;~__VERIFIER_assert__cond~58 := ~__tmp_59~0; {23402#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,094 INFO L273 TraceCheckUtils]: 33: Hoare triple {23402#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~58);havoc ~__tmp_60~0;~__tmp_60~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~59;~__VERIFIER_assert__cond~59 := ~__tmp_60~0; {23402#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,095 INFO L273 TraceCheckUtils]: 34: Hoare triple {23402#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~59);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23415#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,096 INFO L273 TraceCheckUtils]: 35: Hoare triple {23415#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;~main____CPAchecker_TMP_0~7 := #t~nondet18;havoc #t~nondet18; {23415#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,096 INFO L273 TraceCheckUtils]: 36: Hoare triple {23415#(= (_ bv7 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_63~0;~__tmp_63~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~62;~__VERIFIER_assert__cond~62 := ~__tmp_63~0; {23415#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,097 INFO L273 TraceCheckUtils]: 37: Hoare triple {23415#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~62);havoc ~__tmp_64~0;~__tmp_64~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~63;~__VERIFIER_assert__cond~63 := ~__tmp_64~0; {23415#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,097 INFO L273 TraceCheckUtils]: 38: Hoare triple {23415#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~63);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23428#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:19,098 INFO L273 TraceCheckUtils]: 39: Hoare triple {23428#(= (_ bv8 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {23432#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv8 32) main_~main__t~0))} is VALID [2018-11-23 11:38:19,098 INFO L273 TraceCheckUtils]: 40: Hoare triple {23432#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv8 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; {23432#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv8 32) main_~main__t~0))} is VALID [2018-11-23 11:38:19,099 INFO L273 TraceCheckUtils]: 41: Hoare triple {23432#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv8 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {23439#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:19,100 INFO L273 TraceCheckUtils]: 42: Hoare triple {23439#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {23302#false} is VALID [2018-11-23 11:38:19,100 INFO L273 TraceCheckUtils]: 43: Hoare triple {23302#false} assume !false; {23302#false} is VALID [2018-11-23 11:38:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:19,103 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:19,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:19,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 11:38:19,106 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-23 11:38:19,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:19,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:38:19,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:19,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:38:19,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:38:19,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:38:19,166 INFO L87 Difference]: Start difference. First operand 305 states and 360 transitions. Second operand 13 states. [2018-11-23 11:38:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:28,300 INFO L93 Difference]: Finished difference Result 308 states and 362 transitions. [2018-11-23 11:38:28,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:38:28,301 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-23 11:38:28,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:38:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 362 transitions. [2018-11-23 11:38:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:38:28,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 362 transitions. [2018-11-23 11:38:28,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 362 transitions. [2018-11-23 11:38:28,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 362 edges. 362 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:28,686 INFO L225 Difference]: With dead ends: 308 [2018-11-23 11:38:28,687 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 11:38:28,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:38:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 11:38:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-11-23 11:38:28,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:28,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:28,713 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:28,713 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:28,719 INFO L93 Difference]: Finished difference Result 303 states and 357 transitions. [2018-11-23 11:38:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 357 transitions. [2018-11-23 11:38:28,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:28,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:28,720 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:28,720 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:28,727 INFO L93 Difference]: Finished difference Result 303 states and 357 transitions. [2018-11-23 11:38:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 357 transitions. [2018-11-23 11:38:28,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:28,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:28,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:28,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 11:38:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 357 transitions. [2018-11-23 11:38:28,736 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 357 transitions. Word has length 44 [2018-11-23 11:38:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:28,736 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 357 transitions. [2018-11-23 11:38:28,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:38:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 357 transitions. [2018-11-23 11:38:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:38:28,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:28,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:28,737 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:28,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:28,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1522101025, now seen corresponding path program 1 times [2018-11-23 11:38:28,738 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:28,738 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:28,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:28,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:29,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {24681#true} call ULTIMATE.init(); {24681#true} is VALID [2018-11-23 11:38:29,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {24681#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {24681#true} is VALID [2018-11-23 11:38:29,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {24681#true} assume true; {24681#true} is VALID [2018-11-23 11:38:29,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24681#true} {24681#true} #1914#return; {24681#true} is VALID [2018-11-23 11:38:29,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {24681#true} call #t~ret75 := main(); {24681#true} is VALID [2018-11-23 11:38:29,305 INFO L273 TraceCheckUtils]: 5: Hoare triple {24681#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {24681#true} is VALID [2018-11-23 11:38:29,305 INFO L273 TraceCheckUtils]: 6: Hoare triple {24681#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {24704#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,306 INFO L273 TraceCheckUtils]: 7: Hoare triple {24704#(= (_ 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; {24704#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {24704#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {24704#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,306 INFO L273 TraceCheckUtils]: 9: Hoare triple {24704#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {24704#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {24704#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24717#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {24717#(= (_ 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~nondet12;havoc #t~nondet12; {24717#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,307 INFO L273 TraceCheckUtils]: 12: Hoare triple {24717#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {24717#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {24717#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {24717#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {24717#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24730#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {24730#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {24730#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {24730#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {24730#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {24730#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {24730#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {24730#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24743#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,326 INFO L273 TraceCheckUtils]: 19: Hoare triple {24743#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {24743#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {24743#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {24743#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,327 INFO L273 TraceCheckUtils]: 21: Hoare triple {24743#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {24743#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,327 INFO L273 TraceCheckUtils]: 22: Hoare triple {24743#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24756#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,328 INFO L273 TraceCheckUtils]: 23: Hoare triple {24756#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {24756#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,328 INFO L273 TraceCheckUtils]: 24: Hoare triple {24756#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {24756#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,328 INFO L273 TraceCheckUtils]: 25: Hoare triple {24756#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {24756#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,329 INFO L273 TraceCheckUtils]: 26: Hoare triple {24756#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24769#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,329 INFO L273 TraceCheckUtils]: 27: Hoare triple {24769#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet16;havoc #t~nondet16; {24769#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,329 INFO L273 TraceCheckUtils]: 28: Hoare triple {24769#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_55~0;~__tmp_55~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {24769#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,330 INFO L273 TraceCheckUtils]: 29: Hoare triple {24769#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {24769#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,330 INFO L273 TraceCheckUtils]: 30: Hoare triple {24769#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24782#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,331 INFO L273 TraceCheckUtils]: 31: Hoare triple {24782#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;~main____CPAchecker_TMP_0~6 := #t~nondet17;havoc #t~nondet17; {24782#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,331 INFO L273 TraceCheckUtils]: 32: Hoare triple {24782#(= (_ bv6 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_59~0;~__tmp_59~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~58;~__VERIFIER_assert__cond~58 := ~__tmp_59~0; {24782#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,332 INFO L273 TraceCheckUtils]: 33: Hoare triple {24782#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~58);havoc ~__tmp_60~0;~__tmp_60~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~59;~__VERIFIER_assert__cond~59 := ~__tmp_60~0; {24782#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,332 INFO L273 TraceCheckUtils]: 34: Hoare triple {24782#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~59);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24795#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,333 INFO L273 TraceCheckUtils]: 35: Hoare triple {24795#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;~main____CPAchecker_TMP_0~7 := #t~nondet18;havoc #t~nondet18; {24795#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,333 INFO L273 TraceCheckUtils]: 36: Hoare triple {24795#(= (_ bv7 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_63~0;~__tmp_63~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~62;~__VERIFIER_assert__cond~62 := ~__tmp_63~0; {24795#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,334 INFO L273 TraceCheckUtils]: 37: Hoare triple {24795#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~62);havoc ~__tmp_64~0;~__tmp_64~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~63;~__VERIFIER_assert__cond~63 := ~__tmp_64~0; {24795#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,335 INFO L273 TraceCheckUtils]: 38: Hoare triple {24795#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~63);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24808#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,335 INFO L273 TraceCheckUtils]: 39: Hoare triple {24808#(= (_ bv8 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;~main____CPAchecker_TMP_0~8 := #t~nondet19;havoc #t~nondet19; {24808#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,336 INFO L273 TraceCheckUtils]: 40: Hoare triple {24808#(= (_ bv8 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~8);havoc ~__tmp_67~0;~__tmp_67~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~66;~__VERIFIER_assert__cond~66 := ~__tmp_67~0; {24808#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,336 INFO L273 TraceCheckUtils]: 41: Hoare triple {24808#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~66);havoc ~__tmp_68~0;~__tmp_68~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~67;~__VERIFIER_assert__cond~67 := ~__tmp_68~0; {24808#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,337 INFO L273 TraceCheckUtils]: 42: Hoare triple {24808#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~67);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24821#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,338 INFO L273 TraceCheckUtils]: 43: Hoare triple {24821#(= (_ bv9 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {24821#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:38:29,338 INFO L273 TraceCheckUtils]: 44: Hoare triple {24821#(= (_ bv9 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; {24828#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:29,339 INFO L273 TraceCheckUtils]: 45: Hoare triple {24828#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {24682#false} is VALID [2018-11-23 11:38:29,339 INFO L273 TraceCheckUtils]: 46: Hoare triple {24682#false} assume !false; {24682#false} is VALID [2018-11-23 11:38:29,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:29,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:29,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:29,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 11:38:29,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-11-23 11:38:29,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:29,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:38:29,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:29,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:38:29,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:38:29,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:38:29,408 INFO L87 Difference]: Start difference. First operand 303 states and 357 transitions. Second operand 13 states. [2018-11-23 11:38:39,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:39,458 INFO L93 Difference]: Finished difference Result 310 states and 363 transitions. [2018-11-23 11:38:39,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:38:39,458 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-11-23 11:38:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:38:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 363 transitions. [2018-11-23 11:38:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:38:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 363 transitions. [2018-11-23 11:38:39,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 363 transitions. [2018-11-23 11:38:39,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:39,858 INFO L225 Difference]: With dead ends: 310 [2018-11-23 11:38:39,858 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 11:38:39,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:38:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 11:38:39,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2018-11-23 11:38:39,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:39,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 305 states. [2018-11-23 11:38:39,874 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 305 states. [2018-11-23 11:38:39,874 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 305 states. [2018-11-23 11:38:39,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:39,880 INFO L93 Difference]: Finished difference Result 308 states and 361 transitions. [2018-11-23 11:38:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 361 transitions. [2018-11-23 11:38:39,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:39,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:39,881 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 308 states. [2018-11-23 11:38:39,881 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 308 states. [2018-11-23 11:38:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:39,887 INFO L93 Difference]: Finished difference Result 308 states and 361 transitions. [2018-11-23 11:38:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 361 transitions. [2018-11-23 11:38:39,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:39,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:39,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:39,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 11:38:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 359 transitions. [2018-11-23 11:38:39,895 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 359 transitions. Word has length 47 [2018-11-23 11:38:39,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:39,895 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 359 transitions. [2018-11-23 11:38:39,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:38:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 359 transitions. [2018-11-23 11:38:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:38:39,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:39,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:39,896 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:39,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:39,897 INFO L82 PathProgramCache]: Analyzing trace with hash -59505420, now seen corresponding path program 1 times [2018-11-23 11:38:39,897 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:39,897 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:39,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:40,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:40,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {26085#true} call ULTIMATE.init(); {26085#true} is VALID [2018-11-23 11:38:40,300 INFO L273 TraceCheckUtils]: 1: Hoare triple {26085#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {26085#true} is VALID [2018-11-23 11:38:40,300 INFO L273 TraceCheckUtils]: 2: Hoare triple {26085#true} assume true; {26085#true} is VALID [2018-11-23 11:38:40,300 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26085#true} {26085#true} #1914#return; {26085#true} is VALID [2018-11-23 11:38:40,300 INFO L256 TraceCheckUtils]: 4: Hoare triple {26085#true} call #t~ret75 := main(); {26085#true} is VALID [2018-11-23 11:38:40,300 INFO L273 TraceCheckUtils]: 5: Hoare triple {26085#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {26085#true} is VALID [2018-11-23 11:38:40,301 INFO L273 TraceCheckUtils]: 6: Hoare triple {26085#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {26108#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {26108#(= (_ 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; {26108#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,301 INFO L273 TraceCheckUtils]: 8: Hoare triple {26108#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {26108#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {26108#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {26108#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {26108#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26121#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {26121#(= (_ 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~nondet12;havoc #t~nondet12; {26121#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {26121#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {26121#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {26121#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {26121#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,304 INFO L273 TraceCheckUtils]: 14: Hoare triple {26121#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26134#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,304 INFO L273 TraceCheckUtils]: 15: Hoare triple {26134#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {26134#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {26134#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {26134#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,305 INFO L273 TraceCheckUtils]: 17: Hoare triple {26134#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {26134#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {26134#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26147#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {26147#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {26147#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {26147#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {26147#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,307 INFO L273 TraceCheckUtils]: 21: Hoare triple {26147#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {26147#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,308 INFO L273 TraceCheckUtils]: 22: Hoare triple {26147#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26160#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,309 INFO L273 TraceCheckUtils]: 23: Hoare triple {26160#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {26160#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,309 INFO L273 TraceCheckUtils]: 24: Hoare triple {26160#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {26160#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,310 INFO L273 TraceCheckUtils]: 25: Hoare triple {26160#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {26160#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,310 INFO L273 TraceCheckUtils]: 26: Hoare triple {26160#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26173#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {26173#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet16;havoc #t~nondet16; {26173#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,311 INFO L273 TraceCheckUtils]: 28: Hoare triple {26173#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_55~0;~__tmp_55~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {26173#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,312 INFO L273 TraceCheckUtils]: 29: Hoare triple {26173#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {26173#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,312 INFO L273 TraceCheckUtils]: 30: Hoare triple {26173#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26186#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,313 INFO L273 TraceCheckUtils]: 31: Hoare triple {26186#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;~main____CPAchecker_TMP_0~6 := #t~nondet17;havoc #t~nondet17; {26186#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,313 INFO L273 TraceCheckUtils]: 32: Hoare triple {26186#(= (_ bv6 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_59~0;~__tmp_59~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~58;~__VERIFIER_assert__cond~58 := ~__tmp_59~0; {26186#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,314 INFO L273 TraceCheckUtils]: 33: Hoare triple {26186#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~58);havoc ~__tmp_60~0;~__tmp_60~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~59;~__VERIFIER_assert__cond~59 := ~__tmp_60~0; {26186#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,315 INFO L273 TraceCheckUtils]: 34: Hoare triple {26186#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~59);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26199#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,315 INFO L273 TraceCheckUtils]: 35: Hoare triple {26199#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;~main____CPAchecker_TMP_0~7 := #t~nondet18;havoc #t~nondet18; {26199#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,316 INFO L273 TraceCheckUtils]: 36: Hoare triple {26199#(= (_ bv7 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_63~0;~__tmp_63~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~62;~__VERIFIER_assert__cond~62 := ~__tmp_63~0; {26199#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,316 INFO L273 TraceCheckUtils]: 37: Hoare triple {26199#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~62);havoc ~__tmp_64~0;~__tmp_64~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~63;~__VERIFIER_assert__cond~63 := ~__tmp_64~0; {26199#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,317 INFO L273 TraceCheckUtils]: 38: Hoare triple {26199#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~63);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26212#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,317 INFO L273 TraceCheckUtils]: 39: Hoare triple {26212#(= (_ bv8 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;~main____CPAchecker_TMP_0~8 := #t~nondet19;havoc #t~nondet19; {26212#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,318 INFO L273 TraceCheckUtils]: 40: Hoare triple {26212#(= (_ bv8 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~8);havoc ~__tmp_67~0;~__tmp_67~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~66;~__VERIFIER_assert__cond~66 := ~__tmp_67~0; {26212#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,318 INFO L273 TraceCheckUtils]: 41: Hoare triple {26212#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~66);havoc ~__tmp_68~0;~__tmp_68~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~67;~__VERIFIER_assert__cond~67 := ~__tmp_68~0; {26212#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,319 INFO L273 TraceCheckUtils]: 42: Hoare triple {26212#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~67);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26225#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,320 INFO L273 TraceCheckUtils]: 43: Hoare triple {26225#(= (_ bv9 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {26229#(and (= (_ bv9 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:38:40,320 INFO L273 TraceCheckUtils]: 44: Hoare triple {26229#(and (= (_ bv9 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; {26229#(and (= (_ bv9 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:38:40,321 INFO L273 TraceCheckUtils]: 45: Hoare triple {26229#(and (= (_ bv9 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {26236#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:40,322 INFO L273 TraceCheckUtils]: 46: Hoare triple {26236#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {26086#false} is VALID [2018-11-23 11:38:40,322 INFO L273 TraceCheckUtils]: 47: Hoare triple {26086#false} assume !false; {26086#false} is VALID [2018-11-23 11:38:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:40,325 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:40,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:40,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 11:38:40,328 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-11-23 11:38:40,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:40,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:38:40,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:40,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:38:40,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:38:40,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:38:40,391 INFO L87 Difference]: Start difference. First operand 305 states and 359 transitions. Second operand 14 states. [2018-11-23 11:38:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:50,453 INFO L93 Difference]: Finished difference Result 308 states and 361 transitions. [2018-11-23 11:38:50,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:38:50,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-11-23 11:38:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 361 transitions. [2018-11-23 11:38:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 361 transitions. [2018-11-23 11:38:50,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 361 transitions. [2018-11-23 11:38:50,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 361 edges. 361 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:50,846 INFO L225 Difference]: With dead ends: 308 [2018-11-23 11:38:50,846 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 11:38:50,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:38:50,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 11:38:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-11-23 11:38:50,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:50,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:50,854 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:50,854 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:50,859 INFO L93 Difference]: Finished difference Result 303 states and 356 transitions. [2018-11-23 11:38:50,860 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 356 transitions. [2018-11-23 11:38:50,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:50,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:50,860 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:50,860 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:38:50,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:50,866 INFO L93 Difference]: Finished difference Result 303 states and 356 transitions. [2018-11-23 11:38:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 356 transitions. [2018-11-23 11:38:50,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:50,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:50,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:50,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 11:38:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 356 transitions. [2018-11-23 11:38:50,873 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 356 transitions. Word has length 48 [2018-11-23 11:38:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:50,873 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 356 transitions. [2018-11-23 11:38:50,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:38:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 356 transitions. [2018-11-23 11:38:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:38:50,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:50,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:50,875 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:50,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1761798456, now seen corresponding path program 1 times [2018-11-23 11:38:50,875 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:50,876 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:50,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:51,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:51,221 INFO L256 TraceCheckUtils]: 0: Hoare triple {27478#true} call ULTIMATE.init(); {27478#true} is VALID [2018-11-23 11:38:51,221 INFO L273 TraceCheckUtils]: 1: Hoare triple {27478#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {27478#true} is VALID [2018-11-23 11:38:51,221 INFO L273 TraceCheckUtils]: 2: Hoare triple {27478#true} assume true; {27478#true} is VALID [2018-11-23 11:38:51,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27478#true} {27478#true} #1914#return; {27478#true} is VALID [2018-11-23 11:38:51,222 INFO L256 TraceCheckUtils]: 4: Hoare triple {27478#true} call #t~ret75 := main(); {27478#true} is VALID [2018-11-23 11:38:51,222 INFO L273 TraceCheckUtils]: 5: Hoare triple {27478#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {27478#true} is VALID [2018-11-23 11:38:51,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {27478#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {27501#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,223 INFO L273 TraceCheckUtils]: 7: Hoare triple {27501#(= (_ 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; {27501#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,224 INFO L273 TraceCheckUtils]: 8: Hoare triple {27501#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {27501#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {27501#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {27501#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {27501#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27514#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {27514#(= (_ 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~nondet12;havoc #t~nondet12; {27514#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {27514#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {27514#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {27514#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {27514#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,226 INFO L273 TraceCheckUtils]: 14: Hoare triple {27514#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27527#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {27527#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {27527#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {27527#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {27527#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,228 INFO L273 TraceCheckUtils]: 17: Hoare triple {27527#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {27527#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {27527#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27540#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {27540#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {27540#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {27540#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {27540#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {27540#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {27540#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,231 INFO L273 TraceCheckUtils]: 22: Hoare triple {27540#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27553#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {27553#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {27553#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,232 INFO L273 TraceCheckUtils]: 24: Hoare triple {27553#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {27553#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,232 INFO L273 TraceCheckUtils]: 25: Hoare triple {27553#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {27553#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {27553#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27566#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,233 INFO L273 TraceCheckUtils]: 27: Hoare triple {27566#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet16;havoc #t~nondet16; {27566#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,234 INFO L273 TraceCheckUtils]: 28: Hoare triple {27566#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_55~0;~__tmp_55~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {27566#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,234 INFO L273 TraceCheckUtils]: 29: Hoare triple {27566#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {27566#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,235 INFO L273 TraceCheckUtils]: 30: Hoare triple {27566#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27579#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,235 INFO L273 TraceCheckUtils]: 31: Hoare triple {27579#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;~main____CPAchecker_TMP_0~6 := #t~nondet17;havoc #t~nondet17; {27579#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,236 INFO L273 TraceCheckUtils]: 32: Hoare triple {27579#(= (_ bv6 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_59~0;~__tmp_59~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~58;~__VERIFIER_assert__cond~58 := ~__tmp_59~0; {27579#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,236 INFO L273 TraceCheckUtils]: 33: Hoare triple {27579#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~58);havoc ~__tmp_60~0;~__tmp_60~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~59;~__VERIFIER_assert__cond~59 := ~__tmp_60~0; {27579#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {27579#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~59);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27592#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,238 INFO L273 TraceCheckUtils]: 35: Hoare triple {27592#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;~main____CPAchecker_TMP_0~7 := #t~nondet18;havoc #t~nondet18; {27592#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,238 INFO L273 TraceCheckUtils]: 36: Hoare triple {27592#(= (_ bv7 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_63~0;~__tmp_63~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~62;~__VERIFIER_assert__cond~62 := ~__tmp_63~0; {27592#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,239 INFO L273 TraceCheckUtils]: 37: Hoare triple {27592#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~62);havoc ~__tmp_64~0;~__tmp_64~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~63;~__VERIFIER_assert__cond~63 := ~__tmp_64~0; {27592#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,239 INFO L273 TraceCheckUtils]: 38: Hoare triple {27592#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~63);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27605#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,240 INFO L273 TraceCheckUtils]: 39: Hoare triple {27605#(= (_ bv8 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;~main____CPAchecker_TMP_0~8 := #t~nondet19;havoc #t~nondet19; {27605#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,240 INFO L273 TraceCheckUtils]: 40: Hoare triple {27605#(= (_ bv8 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~8);havoc ~__tmp_67~0;~__tmp_67~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~66;~__VERIFIER_assert__cond~66 := ~__tmp_67~0; {27605#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,241 INFO L273 TraceCheckUtils]: 41: Hoare triple {27605#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~66);havoc ~__tmp_68~0;~__tmp_68~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~67;~__VERIFIER_assert__cond~67 := ~__tmp_68~0; {27605#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,242 INFO L273 TraceCheckUtils]: 42: Hoare triple {27605#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~67);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27618#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,242 INFO L273 TraceCheckUtils]: 43: Hoare triple {27618#(= (_ bv9 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;~main____CPAchecker_TMP_0~9 := #t~nondet20;havoc #t~nondet20; {27618#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,243 INFO L273 TraceCheckUtils]: 44: Hoare triple {27618#(= (_ bv9 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~9);havoc ~__tmp_71~0;~__tmp_71~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~70;~__VERIFIER_assert__cond~70 := ~__tmp_71~0; {27618#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,243 INFO L273 TraceCheckUtils]: 45: Hoare triple {27618#(= (_ bv9 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~70);havoc ~__tmp_72~0;~__tmp_72~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~71;~__VERIFIER_assert__cond~71 := ~__tmp_72~0; {27618#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,244 INFO L273 TraceCheckUtils]: 46: Hoare triple {27618#(= (_ bv9 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~71);~main____CPAchecker_TMP_1~9 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27631#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,245 INFO L273 TraceCheckUtils]: 47: Hoare triple {27631#(= (_ bv10 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {27631#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,245 INFO L273 TraceCheckUtils]: 48: Hoare triple {27631#(= (_ bv10 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; {27638#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:51,246 INFO L273 TraceCheckUtils]: 49: Hoare triple {27638#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {27479#false} is VALID [2018-11-23 11:38:51,246 INFO L273 TraceCheckUtils]: 50: Hoare triple {27479#false} assume !false; {27479#false} is VALID [2018-11-23 11:38:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:51,249 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:51,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:51,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 11:38:51,252 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2018-11-23 11:38:51,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:51,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:38:51,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:51,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:38:51,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:38:51,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:38:51,320 INFO L87 Difference]: Start difference. First operand 303 states and 356 transitions. Second operand 14 states. [2018-11-23 11:39:02,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:02,312 INFO L93 Difference]: Finished difference Result 310 states and 362 transitions. [2018-11-23 11:39:02,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:39:02,312 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2018-11-23 11:39:02,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:39:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 362 transitions. [2018-11-23 11:39:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:39:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 362 transitions. [2018-11-23 11:39:02,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 362 transitions. [2018-11-23 11:39:02,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 362 edges. 362 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:02,715 INFO L225 Difference]: With dead ends: 310 [2018-11-23 11:39:02,715 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 11:39:02,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:39:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 11:39:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2018-11-23 11:39:02,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:02,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 305 states. [2018-11-23 11:39:02,721 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 305 states. [2018-11-23 11:39:02,722 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 305 states. [2018-11-23 11:39:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:02,727 INFO L93 Difference]: Finished difference Result 308 states and 360 transitions. [2018-11-23 11:39:02,727 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 360 transitions. [2018-11-23 11:39:02,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:02,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:02,728 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 308 states. [2018-11-23 11:39:02,728 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 308 states. [2018-11-23 11:39:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:02,733 INFO L93 Difference]: Finished difference Result 308 states and 360 transitions. [2018-11-23 11:39:02,733 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 360 transitions. [2018-11-23 11:39:02,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:02,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:02,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:02,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 11:39:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 358 transitions. [2018-11-23 11:39:02,738 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 358 transitions. Word has length 51 [2018-11-23 11:39:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:02,739 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 358 transitions. [2018-11-23 11:39:02,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:39:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 358 transitions. [2018-11-23 11:39:02,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 11:39:02,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:02,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:02,740 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:02,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:02,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1218819651, now seen corresponding path program 1 times [2018-11-23 11:39:02,740 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:02,740 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:02,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:02,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:03,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {28895#true} call ULTIMATE.init(); {28895#true} is VALID [2018-11-23 11:39:03,126 INFO L273 TraceCheckUtils]: 1: Hoare triple {28895#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {28895#true} is VALID [2018-11-23 11:39:03,126 INFO L273 TraceCheckUtils]: 2: Hoare triple {28895#true} assume true; {28895#true} is VALID [2018-11-23 11:39:03,126 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28895#true} {28895#true} #1914#return; {28895#true} is VALID [2018-11-23 11:39:03,126 INFO L256 TraceCheckUtils]: 4: Hoare triple {28895#true} call #t~ret75 := main(); {28895#true} is VALID [2018-11-23 11:39:03,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {28895#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {28895#true} is VALID [2018-11-23 11:39:03,127 INFO L273 TraceCheckUtils]: 6: Hoare triple {28895#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {28918#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,128 INFO L273 TraceCheckUtils]: 7: Hoare triple {28918#(= (_ 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; {28918#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {28918#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {28918#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {28918#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {28918#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,131 INFO L273 TraceCheckUtils]: 10: Hoare triple {28918#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28931#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,131 INFO L273 TraceCheckUtils]: 11: Hoare triple {28931#(= (_ 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~nondet12;havoc #t~nondet12; {28931#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,131 INFO L273 TraceCheckUtils]: 12: Hoare triple {28931#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {28931#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {28931#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {28931#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {28931#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28944#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {28944#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {28944#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {28944#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {28944#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {28944#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {28944#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {28944#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28957#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {28957#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {28957#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {28957#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {28957#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,154 INFO L273 TraceCheckUtils]: 21: Hoare triple {28957#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {28957#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {28957#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28970#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {28970#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {28970#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {28970#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {28970#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,160 INFO L273 TraceCheckUtils]: 25: Hoare triple {28970#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {28970#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,160 INFO L273 TraceCheckUtils]: 26: Hoare triple {28970#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28983#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,161 INFO L273 TraceCheckUtils]: 27: Hoare triple {28983#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet16;havoc #t~nondet16; {28983#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,161 INFO L273 TraceCheckUtils]: 28: Hoare triple {28983#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_55~0;~__tmp_55~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {28983#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,161 INFO L273 TraceCheckUtils]: 29: Hoare triple {28983#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {28983#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {28983#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28996#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,162 INFO L273 TraceCheckUtils]: 31: Hoare triple {28996#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;~main____CPAchecker_TMP_0~6 := #t~nondet17;havoc #t~nondet17; {28996#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,163 INFO L273 TraceCheckUtils]: 32: Hoare triple {28996#(= (_ bv6 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_59~0;~__tmp_59~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~58;~__VERIFIER_assert__cond~58 := ~__tmp_59~0; {28996#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {28996#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~58);havoc ~__tmp_60~0;~__tmp_60~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~59;~__VERIFIER_assert__cond~59 := ~__tmp_60~0; {28996#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,164 INFO L273 TraceCheckUtils]: 34: Hoare triple {28996#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~59);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29009#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,164 INFO L273 TraceCheckUtils]: 35: Hoare triple {29009#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;~main____CPAchecker_TMP_0~7 := #t~nondet18;havoc #t~nondet18; {29009#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,165 INFO L273 TraceCheckUtils]: 36: Hoare triple {29009#(= (_ bv7 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_63~0;~__tmp_63~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~62;~__VERIFIER_assert__cond~62 := ~__tmp_63~0; {29009#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,165 INFO L273 TraceCheckUtils]: 37: Hoare triple {29009#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~62);havoc ~__tmp_64~0;~__tmp_64~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~63;~__VERIFIER_assert__cond~63 := ~__tmp_64~0; {29009#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {29009#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~63);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29022#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,166 INFO L273 TraceCheckUtils]: 39: Hoare triple {29022#(= (_ bv8 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;~main____CPAchecker_TMP_0~8 := #t~nondet19;havoc #t~nondet19; {29022#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,167 INFO L273 TraceCheckUtils]: 40: Hoare triple {29022#(= (_ bv8 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~8);havoc ~__tmp_67~0;~__tmp_67~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~66;~__VERIFIER_assert__cond~66 := ~__tmp_67~0; {29022#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,167 INFO L273 TraceCheckUtils]: 41: Hoare triple {29022#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~66);havoc ~__tmp_68~0;~__tmp_68~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~67;~__VERIFIER_assert__cond~67 := ~__tmp_68~0; {29022#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,168 INFO L273 TraceCheckUtils]: 42: Hoare triple {29022#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~67);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29035#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,169 INFO L273 TraceCheckUtils]: 43: Hoare triple {29035#(= (_ bv9 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;~main____CPAchecker_TMP_0~9 := #t~nondet20;havoc #t~nondet20; {29035#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,169 INFO L273 TraceCheckUtils]: 44: Hoare triple {29035#(= (_ bv9 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~9);havoc ~__tmp_71~0;~__tmp_71~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~70;~__VERIFIER_assert__cond~70 := ~__tmp_71~0; {29035#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,170 INFO L273 TraceCheckUtils]: 45: Hoare triple {29035#(= (_ bv9 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~70);havoc ~__tmp_72~0;~__tmp_72~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~71;~__VERIFIER_assert__cond~71 := ~__tmp_72~0; {29035#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,171 INFO L273 TraceCheckUtils]: 46: Hoare triple {29035#(= (_ bv9 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~71);~main____CPAchecker_TMP_1~9 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29048#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,171 INFO L273 TraceCheckUtils]: 47: Hoare triple {29048#(= (_ bv10 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {29052#(and (= (_ bv10 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:39:03,172 INFO L273 TraceCheckUtils]: 48: Hoare triple {29052#(and (= (_ bv10 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; {29052#(and (= (_ bv10 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:39:03,173 INFO L273 TraceCheckUtils]: 49: Hoare triple {29052#(and (= (_ bv10 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {29059#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:03,173 INFO L273 TraceCheckUtils]: 50: Hoare triple {29059#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {28896#false} is VALID [2018-11-23 11:39:03,174 INFO L273 TraceCheckUtils]: 51: Hoare triple {28896#false} assume !false; {28896#false} is VALID [2018-11-23 11:39:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:03,177 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:03,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:03,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 11:39:03,180 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-11-23 11:39:03,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:03,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:39:03,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:03,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:39:03,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:39:03,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:39:03,248 INFO L87 Difference]: Start difference. First operand 305 states and 358 transitions. Second operand 15 states. [2018-11-23 11:39:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:14,197 INFO L93 Difference]: Finished difference Result 308 states and 360 transitions. [2018-11-23 11:39:14,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:39:14,197 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-11-23 11:39:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:39:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 360 transitions. [2018-11-23 11:39:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:39:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 360 transitions. [2018-11-23 11:39:14,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 360 transitions. [2018-11-23 11:39:14,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:14,582 INFO L225 Difference]: With dead ends: 308 [2018-11-23 11:39:14,582 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 11:39:14,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:39:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 11:39:14,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-11-23 11:39:14,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:14,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand 303 states. [2018-11-23 11:39:14,666 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:39:14,667 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:39:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:14,673 INFO L93 Difference]: Finished difference Result 303 states and 355 transitions. [2018-11-23 11:39:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 355 transitions. [2018-11-23 11:39:14,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:14,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:14,674 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 303 states. [2018-11-23 11:39:14,674 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 303 states. [2018-11-23 11:39:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:14,681 INFO L93 Difference]: Finished difference Result 303 states and 355 transitions. [2018-11-23 11:39:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 355 transitions. [2018-11-23 11:39:14,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:14,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:14,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:14,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 11:39:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 355 transitions. [2018-11-23 11:39:14,689 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 355 transitions. Word has length 52 [2018-11-23 11:39:14,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:14,689 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 355 transitions. [2018-11-23 11:39:14,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:39:14,690 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 355 transitions. [2018-11-23 11:39:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:39:14,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:14,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:14,691 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:14,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:14,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1461994161, now seen corresponding path program 1 times [2018-11-23 11:39:14,691 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:14,692 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:14,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:14,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:15,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {30301#true} call ULTIMATE.init(); {30301#true} is VALID [2018-11-23 11:39:15,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {30301#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {30301#true} is VALID [2018-11-23 11:39:15,354 INFO L273 TraceCheckUtils]: 2: Hoare triple {30301#true} assume true; {30301#true} is VALID [2018-11-23 11:39:15,354 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30301#true} {30301#true} #1914#return; {30301#true} is VALID [2018-11-23 11:39:15,354 INFO L256 TraceCheckUtils]: 4: Hoare triple {30301#true} call #t~ret75 := main(); {30301#true} is VALID [2018-11-23 11:39:15,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {30301#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {30301#true} is VALID [2018-11-23 11:39:15,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {30301#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {30324#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {30324#(= (_ 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; {30324#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {30324#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {30324#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {30324#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {30324#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {30324#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30337#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {30337#(= (_ 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~nondet12;havoc #t~nondet12; {30337#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {30337#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {30337#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {30337#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {30337#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {30337#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30350#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {30350#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {30350#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {30350#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {30350#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {30350#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {30350#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {30350#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30363#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {30363#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {30363#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {30363#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {30363#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {30363#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {30363#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {30363#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30376#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,363 INFO L273 TraceCheckUtils]: 23: Hoare triple {30376#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {30376#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {30376#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {30376#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,364 INFO L273 TraceCheckUtils]: 25: Hoare triple {30376#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {30376#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {30376#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30389#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,365 INFO L273 TraceCheckUtils]: 27: Hoare triple {30389#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet16;havoc #t~nondet16; {30389#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,366 INFO L273 TraceCheckUtils]: 28: Hoare triple {30389#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_55~0;~__tmp_55~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {30389#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,366 INFO L273 TraceCheckUtils]: 29: Hoare triple {30389#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {30389#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,367 INFO L273 TraceCheckUtils]: 30: Hoare triple {30389#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30402#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {30402#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;~main____CPAchecker_TMP_0~6 := #t~nondet17;havoc #t~nondet17; {30402#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,368 INFO L273 TraceCheckUtils]: 32: Hoare triple {30402#(= (_ bv6 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_59~0;~__tmp_59~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~58;~__VERIFIER_assert__cond~58 := ~__tmp_59~0; {30402#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,368 INFO L273 TraceCheckUtils]: 33: Hoare triple {30402#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~58);havoc ~__tmp_60~0;~__tmp_60~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~59;~__VERIFIER_assert__cond~59 := ~__tmp_60~0; {30402#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,369 INFO L273 TraceCheckUtils]: 34: Hoare triple {30402#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~59);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30415#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,370 INFO L273 TraceCheckUtils]: 35: Hoare triple {30415#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;~main____CPAchecker_TMP_0~7 := #t~nondet18;havoc #t~nondet18; {30415#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,370 INFO L273 TraceCheckUtils]: 36: Hoare triple {30415#(= (_ bv7 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_63~0;~__tmp_63~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~62;~__VERIFIER_assert__cond~62 := ~__tmp_63~0; {30415#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,371 INFO L273 TraceCheckUtils]: 37: Hoare triple {30415#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~62);havoc ~__tmp_64~0;~__tmp_64~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~63;~__VERIFIER_assert__cond~63 := ~__tmp_64~0; {30415#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,371 INFO L273 TraceCheckUtils]: 38: Hoare triple {30415#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~63);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30428#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,372 INFO L273 TraceCheckUtils]: 39: Hoare triple {30428#(= (_ bv8 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;~main____CPAchecker_TMP_0~8 := #t~nondet19;havoc #t~nondet19; {30428#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,372 INFO L273 TraceCheckUtils]: 40: Hoare triple {30428#(= (_ bv8 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~8);havoc ~__tmp_67~0;~__tmp_67~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~66;~__VERIFIER_assert__cond~66 := ~__tmp_67~0; {30428#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,373 INFO L273 TraceCheckUtils]: 41: Hoare triple {30428#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~66);havoc ~__tmp_68~0;~__tmp_68~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~67;~__VERIFIER_assert__cond~67 := ~__tmp_68~0; {30428#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,374 INFO L273 TraceCheckUtils]: 42: Hoare triple {30428#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~67);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30441#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,374 INFO L273 TraceCheckUtils]: 43: Hoare triple {30441#(= (_ bv9 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;~main____CPAchecker_TMP_0~9 := #t~nondet20;havoc #t~nondet20; {30441#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,375 INFO L273 TraceCheckUtils]: 44: Hoare triple {30441#(= (_ bv9 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~9);havoc ~__tmp_71~0;~__tmp_71~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~70;~__VERIFIER_assert__cond~70 := ~__tmp_71~0; {30441#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,375 INFO L273 TraceCheckUtils]: 45: Hoare triple {30441#(= (_ bv9 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~70);havoc ~__tmp_72~0;~__tmp_72~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~71;~__VERIFIER_assert__cond~71 := ~__tmp_72~0; {30441#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,376 INFO L273 TraceCheckUtils]: 46: Hoare triple {30441#(= (_ bv9 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~71);~main____CPAchecker_TMP_1~9 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30454#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,376 INFO L273 TraceCheckUtils]: 47: Hoare triple {30454#(= (_ bv10 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~10;~main____CPAchecker_TMP_0~10 := #t~nondet21;havoc #t~nondet21; {30454#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,377 INFO L273 TraceCheckUtils]: 48: Hoare triple {30454#(= (_ bv10 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~10);havoc ~__tmp_75~0;~__tmp_75~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~74;~__VERIFIER_assert__cond~74 := ~__tmp_75~0; {30454#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,377 INFO L273 TraceCheckUtils]: 49: Hoare triple {30454#(= (_ bv10 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~74);havoc ~__tmp_76~0;~__tmp_76~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~75;~__VERIFIER_assert__cond~75 := ~__tmp_76~0; {30454#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,378 INFO L273 TraceCheckUtils]: 50: Hoare triple {30454#(= (_ bv10 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~75);~main____CPAchecker_TMP_1~10 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30467#(= (_ bv11 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,379 INFO L273 TraceCheckUtils]: 51: Hoare triple {30467#(= (_ bv11 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {30467#(= (_ bv11 32) main_~main__t~0)} is VALID [2018-11-23 11:39:15,380 INFO L273 TraceCheckUtils]: 52: Hoare triple {30467#(= (_ bv11 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; {30474#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:15,380 INFO L273 TraceCheckUtils]: 53: Hoare triple {30474#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {30302#false} is VALID [2018-11-23 11:39:15,380 INFO L273 TraceCheckUtils]: 54: Hoare triple {30302#false} assume !false; {30302#false} is VALID [2018-11-23 11:39:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:15,384 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:15,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:15,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 11:39:15,386 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-11-23 11:39:15,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:15,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:39:15,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:15,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:39:15,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:39:15,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:39:15,459 INFO L87 Difference]: Start difference. First operand 303 states and 355 transitions. Second operand 15 states. [2018-11-23 11:39:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:27,176 INFO L93 Difference]: Finished difference Result 310 states and 361 transitions. [2018-11-23 11:39:27,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:39:27,176 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-11-23 11:39:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:39:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 361 transitions. [2018-11-23 11:39:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:39:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 361 transitions. [2018-11-23 11:39:27,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 361 transitions. [2018-11-23 11:39:27,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 361 edges. 361 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:27,558 INFO L225 Difference]: With dead ends: 310 [2018-11-23 11:39:27,558 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 11:39:27,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:39:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 11:39:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2018-11-23 11:39:27,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:27,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 305 states. [2018-11-23 11:39:27,566 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 305 states. [2018-11-23 11:39:27,566 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 305 states. [2018-11-23 11:39:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:27,572 INFO L93 Difference]: Finished difference Result 308 states and 359 transitions. [2018-11-23 11:39:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 359 transitions. [2018-11-23 11:39:27,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:27,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:27,573 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 308 states. [2018-11-23 11:39:27,573 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 308 states. [2018-11-23 11:39:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:27,578 INFO L93 Difference]: Finished difference Result 308 states and 359 transitions. [2018-11-23 11:39:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 359 transitions. [2018-11-23 11:39:27,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:27,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:27,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:27,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 11:39:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 357 transitions. [2018-11-23 11:39:27,584 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 357 transitions. Word has length 55 [2018-11-23 11:39:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:27,584 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 357 transitions. [2018-11-23 11:39:27,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:39:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 357 transitions. [2018-11-23 11:39:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:39:27,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:27,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:27,585 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:27,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:27,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1922824326, now seen corresponding path program 1 times [2018-11-23 11:39:27,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:27,586 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:27,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:27,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:28,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {31731#true} call ULTIMATE.init(); {31731#true} is VALID [2018-11-23 11:39:28,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {31731#true} ~__return_main~0 := 0bv32;~__tmp_109_0~0 := 0bv32;~__tmp_109_1~0 := 0bv32;~__tmp_148_0~0 := 0bv32;~__tmp_179_0~0 := 0bv32;~__tmp_179_1~0 := 0bv32;~__tmp_179_2~0 := 0bv32;~__tmp_218_0~0 := 0bv32;~__tmp_2390_0~0 := 0bv32;~__tmp_2390_1~0 := 0bv32;~__return_2583~0 := 0bv32; {31731#true} is VALID [2018-11-23 11:39:28,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {31731#true} assume true; {31731#true} is VALID [2018-11-23 11:39:28,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31731#true} {31731#true} #1914#return; {31731#true} is VALID [2018-11-23 11:39:28,071 INFO L256 TraceCheckUtils]: 4: Hoare triple {31731#true} call #t~ret75 := main(); {31731#true} is VALID [2018-11-23 11:39:28,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {31731#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {31731#true} is VALID [2018-11-23 11:39:28,072 INFO L273 TraceCheckUtils]: 6: Hoare triple {31731#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {31754#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {31754#(= (_ 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; {31754#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {31754#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {31754#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {31754#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {31754#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {31754#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31767#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {31767#(= (_ 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~nondet12;havoc #t~nondet12; {31767#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {31767#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_39~0;~__tmp_39~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {31767#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,075 INFO L273 TraceCheckUtils]: 13: Hoare triple {31767#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {31767#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {31767#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31780#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {31780#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet13;havoc #t~nondet13; {31780#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {31780#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_43~0;~__tmp_43~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {31780#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {31780#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {31780#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {31780#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31793#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {31793#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet14;havoc #t~nondet14; {31793#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {31793#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_47~0;~__tmp_47~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {31793#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {31793#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {31793#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,079 INFO L273 TraceCheckUtils]: 22: Hoare triple {31793#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31806#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {31806#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet15;havoc #t~nondet15; {31806#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,080 INFO L273 TraceCheckUtils]: 24: Hoare triple {31806#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_51~0;~__tmp_51~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {31806#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {31806#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {31806#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {31806#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~51);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31819#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {31819#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet16;havoc #t~nondet16; {31819#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,083 INFO L273 TraceCheckUtils]: 28: Hoare triple {31819#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_55~0;~__tmp_55~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~54;~__VERIFIER_assert__cond~54 := ~__tmp_55~0; {31819#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,083 INFO L273 TraceCheckUtils]: 29: Hoare triple {31819#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~54);havoc ~__tmp_56~0;~__tmp_56~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~55;~__VERIFIER_assert__cond~55 := ~__tmp_56~0; {31819#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,105 INFO L273 TraceCheckUtils]: 30: Hoare triple {31819#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~55);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31832#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,118 INFO L273 TraceCheckUtils]: 31: Hoare triple {31832#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;~main____CPAchecker_TMP_0~6 := #t~nondet17;havoc #t~nondet17; {31832#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,126 INFO L273 TraceCheckUtils]: 32: Hoare triple {31832#(= (_ bv6 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_59~0;~__tmp_59~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~58;~__VERIFIER_assert__cond~58 := ~__tmp_59~0; {31832#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,141 INFO L273 TraceCheckUtils]: 33: Hoare triple {31832#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~58);havoc ~__tmp_60~0;~__tmp_60~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~59;~__VERIFIER_assert__cond~59 := ~__tmp_60~0; {31832#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,150 INFO L273 TraceCheckUtils]: 34: Hoare triple {31832#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~59);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31845#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,156 INFO L273 TraceCheckUtils]: 35: Hoare triple {31845#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;~main____CPAchecker_TMP_0~7 := #t~nondet18;havoc #t~nondet18; {31845#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {31845#(= (_ bv7 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_63~0;~__tmp_63~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~62;~__VERIFIER_assert__cond~62 := ~__tmp_63~0; {31845#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,183 INFO L273 TraceCheckUtils]: 37: Hoare triple {31845#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~62);havoc ~__tmp_64~0;~__tmp_64~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~63;~__VERIFIER_assert__cond~63 := ~__tmp_64~0; {31845#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,192 INFO L273 TraceCheckUtils]: 38: Hoare triple {31845#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~63);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31858#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,192 INFO L273 TraceCheckUtils]: 39: Hoare triple {31858#(= (_ bv8 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;~main____CPAchecker_TMP_0~8 := #t~nondet19;havoc #t~nondet19; {31858#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,197 INFO L273 TraceCheckUtils]: 40: Hoare triple {31858#(= (_ bv8 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~8);havoc ~__tmp_67~0;~__tmp_67~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~66;~__VERIFIER_assert__cond~66 := ~__tmp_67~0; {31858#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,197 INFO L273 TraceCheckUtils]: 41: Hoare triple {31858#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~66);havoc ~__tmp_68~0;~__tmp_68~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~67;~__VERIFIER_assert__cond~67 := ~__tmp_68~0; {31858#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,198 INFO L273 TraceCheckUtils]: 42: Hoare triple {31858#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~67);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31871#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,198 INFO L273 TraceCheckUtils]: 43: Hoare triple {31871#(= (_ bv9 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;~main____CPAchecker_TMP_0~9 := #t~nondet20;havoc #t~nondet20; {31871#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,198 INFO L273 TraceCheckUtils]: 44: Hoare triple {31871#(= (_ bv9 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~9);havoc ~__tmp_71~0;~__tmp_71~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~70;~__VERIFIER_assert__cond~70 := ~__tmp_71~0; {31871#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,199 INFO L273 TraceCheckUtils]: 45: Hoare triple {31871#(= (_ bv9 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~70);havoc ~__tmp_72~0;~__tmp_72~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~71;~__VERIFIER_assert__cond~71 := ~__tmp_72~0; {31871#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,199 INFO L273 TraceCheckUtils]: 46: Hoare triple {31871#(= (_ bv9 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~71);~main____CPAchecker_TMP_1~9 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31884#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,199 INFO L273 TraceCheckUtils]: 47: Hoare triple {31884#(= (_ bv10 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~10;~main____CPAchecker_TMP_0~10 := #t~nondet21;havoc #t~nondet21; {31884#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,200 INFO L273 TraceCheckUtils]: 48: Hoare triple {31884#(= (_ bv10 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~10);havoc ~__tmp_75~0;~__tmp_75~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~74;~__VERIFIER_assert__cond~74 := ~__tmp_75~0; {31884#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,200 INFO L273 TraceCheckUtils]: 49: Hoare triple {31884#(= (_ bv10 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~74);havoc ~__tmp_76~0;~__tmp_76~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~75;~__VERIFIER_assert__cond~75 := ~__tmp_76~0; {31884#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,200 INFO L273 TraceCheckUtils]: 50: Hoare triple {31884#(= (_ bv10 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~75);~main____CPAchecker_TMP_1~10 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31897#(= (_ bv11 32) main_~main__t~0)} is VALID [2018-11-23 11:39:28,201 INFO L273 TraceCheckUtils]: 51: Hoare triple {31897#(= (_ bv11 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {31901#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv11 32) main_~main__t~0))} is VALID [2018-11-23 11:39:28,202 INFO L273 TraceCheckUtils]: 52: Hoare triple {31901#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv11 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; {31901#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv11 32) main_~main__t~0))} is VALID [2018-11-23 11:39:28,203 INFO L273 TraceCheckUtils]: 53: Hoare triple {31901#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv11 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {31908#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:28,203 INFO L273 TraceCheckUtils]: 54: Hoare triple {31908#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {31732#false} is VALID [2018-11-23 11:39:28,203 INFO L273 TraceCheckUtils]: 55: Hoare triple {31732#false} assume !false; {31732#false} is VALID [2018-11-23 11:39:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:28,207 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:28,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:28,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-23 11:39:28,210 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-11-23 11:39:28,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:28,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:39:28,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:28,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:39:28,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:39:28,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:39:28,283 INFO L87 Difference]: Start difference. First operand 305 states and 357 transitions. Second operand 16 states.