java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:26:42,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:26:42,119 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:26:42,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:26:42,138 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:26:42,139 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:26:42,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:26:42,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:26:42,144 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:26:42,144 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:26:42,145 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:26:42,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:26:42,147 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:26:42,150 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:26:42,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:26:42,152 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:26:42,153 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:26:42,155 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:26:42,157 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:26:42,158 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:26:42,160 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:26:42,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:26:42,164 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:26:42,164 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:26:42,164 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:26:42,165 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:26:42,166 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:26:42,167 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:26:42,168 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:26:42,169 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:26:42,169 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:26:42,170 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:26:42,170 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:26:42,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:26:42,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:26:42,172 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:26:42,173 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-18 22:26:42,199 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:26:42,199 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:26:42,201 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:26:42,201 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:26:42,202 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:26:42,205 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:26:42,205 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:26:42,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:26:42,206 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:26:42,206 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:26:42,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:26:42,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:26:42,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:26:42,207 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:26:42,207 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:26:42,207 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:26:42,207 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:26:42,207 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:26:42,208 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:26:42,208 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:26:42,208 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:26:42,208 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:26:42,208 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:26:42,209 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:26:42,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:26:42,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:26:42,209 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:26:42,209 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:26:42,210 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:26:42,210 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:26:42,210 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:26:42,210 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:26:42,210 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:26:42,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:26:42,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:26:42,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:26:42,273 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:26:42,273 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:26:42,274 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-18 22:26:42,333 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f30ce2ea/f8214f9907c944fc893da4e508aea1e8/FLAGef0788714 [2018-11-18 22:26:42,816 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:26:42,816 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-18 22:26:42,831 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f30ce2ea/f8214f9907c944fc893da4e508aea1e8/FLAGef0788714 [2018-11-18 22:26:43,132 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f30ce2ea/f8214f9907c944fc893da4e508aea1e8 [2018-11-18 22:26:43,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:26:43,142 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:26:43,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:26:43,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:26:43,147 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:26:43,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:26:43" (1/1) ... [2018-11-18 22:26:43,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3014c986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:26:43, skipping insertion in model container [2018-11-18 22:26:43,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:26:43" (1/1) ... [2018-11-18 22:26:43,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:26:43,221 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:26:43,642 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:26:43,648 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:26:43,776 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:26:43,795 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:26:43,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:26:43 WrapperNode [2018-11-18 22:26:43,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:26:43,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:26:43,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:26:43,797 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:26:43,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:26:43" (1/1) ... [2018-11-18 22:26:43,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:26:43" (1/1) ... [2018-11-18 22:26:43,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:26:43" (1/1) ... [2018-11-18 22:26:43,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:26:43" (1/1) ... [2018-11-18 22:26:43,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:26:43" (1/1) ... [2018-11-18 22:26:43,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:26:43" (1/1) ... [2018-11-18 22:26:43,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:26:43" (1/1) ... [2018-11-18 22:26:43,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:26:43,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:26:43,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:26:43,972 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:26:43,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:26:43" (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-18 22:26:44,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:26:44,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:26:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:26:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:26:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 22:26:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:26:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:26:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:26:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:26:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:26:46,340 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:26:46,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:26:46 BoogieIcfgContainer [2018-11-18 22:26:46,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:26:46,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:26:46,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:26:46,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:26:46,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:26:43" (1/3) ... [2018-11-18 22:26:46,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3395ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:26:46, skipping insertion in model container [2018-11-18 22:26:46,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:26:43" (2/3) ... [2018-11-18 22:26:46,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3395ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:26:46, skipping insertion in model container [2018-11-18 22:26:46,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:26:46" (3/3) ... [2018-11-18 22:26:46,350 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-18 22:26:46,361 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:26:46,370 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-18 22:26:46,389 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-18 22:26:46,430 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:26:46,431 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:26:46,431 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:26:46,431 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:26:46,431 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:26:46,432 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:26:46,432 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:26:46,432 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:26:46,433 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:26:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2018-11-18 22:26:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 22:26:46,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:26:46,467 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:26:46,470 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:26:46,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:26:46,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2018-11-18 22:26:46,482 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:26:46,483 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-18 22:26:46,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:26:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:46,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:26:46,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {128#true} call ULTIMATE.init(); {128#true} is VALID [2018-11-18 22:26:46,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {128#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {128#true} is VALID [2018-11-18 22:26:46,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {128#true} assume true; {128#true} is VALID [2018-11-18 22:26:46,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {128#true} {128#true} #388#return; {128#true} is VALID [2018-11-18 22:26:46,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {128#true} call #t~ret15 := main(); {128#true} is VALID [2018-11-18 22:26:46,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {128#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {128#true} is VALID [2018-11-18 22:26:46,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {128#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {151#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:46,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {151#(= (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {151#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:46,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {151#(= (_ bv0 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {158#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:26:46,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {158#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {129#false} is VALID [2018-11-18 22:26:46,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {129#false} assume !false; {129#false} is VALID [2018-11-18 22:26:46,864 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-18 22:26:46,865 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 22:26:46,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:26:46,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:26:46,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-18 22:26:46,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:26:46,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:26:46,922 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-18 22:26:46,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:26:46,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:26:46,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:26:46,934 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2018-11-18 22:26:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:48,711 INFO L93 Difference]: Finished difference Result 141 states and 219 transitions. [2018-11-18 22:26:48,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:26:48,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-18 22:26:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:26:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:26:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2018-11-18 22:26:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:26:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2018-11-18 22:26:48,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 219 transitions. [2018-11-18 22:26:49,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:26:49,189 INFO L225 Difference]: With dead ends: 141 [2018-11-18 22:26:49,190 INFO L226 Difference]: Without dead ends: 125 [2018-11-18 22:26:49,194 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:26:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-18 22:26:49,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-11-18 22:26:49,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:26:49,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 122 states. [2018-11-18 22:26:49,259 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 122 states. [2018-11-18 22:26:49,259 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 122 states. [2018-11-18 22:26:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:49,270 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-18 22:26:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2018-11-18 22:26:49,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:26:49,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:26:49,273 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 125 states. [2018-11-18 22:26:49,273 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 125 states. [2018-11-18 22:26:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:49,284 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-18 22:26:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2018-11-18 22:26:49,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:26:49,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:26:49,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:26:49,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:26:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 22:26:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2018-11-18 22:26:49,297 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 11 [2018-11-18 22:26:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:26:49,297 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2018-11-18 22:26:49,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:26:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2018-11-18 22:26:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 22:26:49,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:26:49,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:26:49,300 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:26:49,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:26:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2018-11-18 22:26:49,301 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:26:49,301 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-18 22:26:49,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:26:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:49,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:26:49,429 INFO L256 TraceCheckUtils]: 0: Hoare triple {699#true} call ULTIMATE.init(); {699#true} is VALID [2018-11-18 22:26:49,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {699#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {699#true} is VALID [2018-11-18 22:26:49,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {699#true} assume true; {699#true} is VALID [2018-11-18 22:26:49,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {699#true} {699#true} #388#return; {699#true} is VALID [2018-11-18 22:26:49,431 INFO L256 TraceCheckUtils]: 4: Hoare triple {699#true} call #t~ret15 := main(); {699#true} is VALID [2018-11-18 22:26:49,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {699#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {699#true} is VALID [2018-11-18 22:26:49,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {699#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {722#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:49,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {722#(= (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {726#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:26:49,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {726#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {726#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:26:49,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {726#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {733#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:26:49,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {733#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {700#false} is VALID [2018-11-18 22:26:49,446 INFO L273 TraceCheckUtils]: 11: Hoare triple {700#false} assume !false; {700#false} is VALID [2018-11-18 22:26:49,447 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-18 22:26:49,448 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:26:49,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:26:49,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:26:49,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-18 22:26:49,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:26:49,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:26:49,507 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-18 22:26:49,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:26:49,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:26:49,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:26:49,508 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand 5 states. [2018-11-18 22:26:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:50,640 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-18 22:26:50,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:26:50,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-18 22:26:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:26:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:26:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2018-11-18 22:26:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:26:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2018-11-18 22:26:50,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 145 transitions. [2018-11-18 22:26:50,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:26:50,912 INFO L225 Difference]: With dead ends: 125 [2018-11-18 22:26:50,912 INFO L226 Difference]: Without dead ends: 120 [2018-11-18 22:26:50,913 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:26:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-18 22:26:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-18 22:26:50,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:26:50,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 120 states. [2018-11-18 22:26:50,970 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2018-11-18 22:26:50,970 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2018-11-18 22:26:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:50,976 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2018-11-18 22:26:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-11-18 22:26:50,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:26:50,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:26:50,978 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2018-11-18 22:26:50,978 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2018-11-18 22:26:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:50,984 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2018-11-18 22:26:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-11-18 22:26:50,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:26:50,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:26:50,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:26:50,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:26:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-18 22:26:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-11-18 22:26:50,992 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 12 [2018-11-18 22:26:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:26:50,992 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-11-18 22:26:50,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:26:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-11-18 22:26:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 22:26:50,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:26:50,994 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:26:50,994 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:26:50,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:26:50,995 INFO L82 PathProgramCache]: Analyzing trace with hash 489213650, now seen corresponding path program 1 times [2018-11-18 22:26:50,995 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:26:50,995 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-18 22:26:51,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:26:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:51,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:26:51,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {1243#true} call ULTIMATE.init(); {1243#true} is VALID [2018-11-18 22:26:51,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {1243#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {1243#true} is VALID [2018-11-18 22:26:51,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2018-11-18 22:26:51,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1243#true} #388#return; {1243#true} is VALID [2018-11-18 22:26:51,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {1243#true} call #t~ret15 := main(); {1243#true} is VALID [2018-11-18 22:26:51,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {1243#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1243#true} is VALID [2018-11-18 22:26:51,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {1243#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {1266#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:51,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {1266#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {1266#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:51,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {1266#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {1266#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:51,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {1266#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {1266#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:51,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {1266#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {1279#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:26:51,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {1279#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {1279#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:26:51,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {1279#(= (_ bv1 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1286#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:26:51,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {1286#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {1244#false} is VALID [2018-11-18 22:26:51,147 INFO L273 TraceCheckUtils]: 14: Hoare triple {1244#false} assume !false; {1244#false} is VALID [2018-11-18 22:26:51,148 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-18 22:26:51,149 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:26:51,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:26:51,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:26:51,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 22:26:51,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:26:51,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:26:51,183 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-18 22:26:51,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:26:51,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:26:51,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:26:51,185 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 5 states. [2018-11-18 22:26:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:52,400 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2018-11-18 22:26:52,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:26:52,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 22:26:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:26:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:26:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2018-11-18 22:26:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:26:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2018-11-18 22:26:52,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 178 transitions. [2018-11-18 22:26:52,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:26:52,778 INFO L225 Difference]: With dead ends: 157 [2018-11-18 22:26:52,778 INFO L226 Difference]: Without dead ends: 155 [2018-11-18 22:26:52,779 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:26:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-18 22:26:52,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2018-11-18 22:26:52,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:26:52,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 122 states. [2018-11-18 22:26:52,801 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 122 states. [2018-11-18 22:26:52,801 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 122 states. [2018-11-18 22:26:52,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:52,808 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2018-11-18 22:26:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2018-11-18 22:26:52,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:26:52,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:26:52,809 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 155 states. [2018-11-18 22:26:52,810 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 155 states. [2018-11-18 22:26:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:52,816 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2018-11-18 22:26:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2018-11-18 22:26:52,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:26:52,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:26:52,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:26:52,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:26:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 22:26:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-11-18 22:26:52,823 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 15 [2018-11-18 22:26:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:26:52,824 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-11-18 22:26:52,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:26:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-11-18 22:26:52,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 22:26:52,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:26:52,825 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:26:52,825 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:26:52,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:26:52,826 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2018-11-18 22:26:52,826 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:26:52,827 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-18 22:26:52,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:26:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:52,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:26:53,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {1903#true} call ULTIMATE.init(); {1903#true} is VALID [2018-11-18 22:26:53,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {1903#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {1903#true} is VALID [2018-11-18 22:26:53,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {1903#true} assume true; {1903#true} is VALID [2018-11-18 22:26:53,045 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1903#true} {1903#true} #388#return; {1903#true} is VALID [2018-11-18 22:26:53,045 INFO L256 TraceCheckUtils]: 4: Hoare triple {1903#true} call #t~ret15 := main(); {1903#true} is VALID [2018-11-18 22:26:53,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {1903#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1903#true} is VALID [2018-11-18 22:26:53,046 INFO L273 TraceCheckUtils]: 6: Hoare triple {1903#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {1926#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:53,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {1926#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {1926#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:53,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {1926#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1926#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:53,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {1926#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1926#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:53,049 INFO L273 TraceCheckUtils]: 10: Hoare triple {1926#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {1939#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:26:53,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {1939#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {1939#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:26:53,051 INFO L273 TraceCheckUtils]: 12: Hoare triple {1939#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {1946#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:26:53,055 INFO L273 TraceCheckUtils]: 13: Hoare triple {1946#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {1904#false} is VALID [2018-11-18 22:26:53,055 INFO L273 TraceCheckUtils]: 14: Hoare triple {1904#false} assume !false; {1904#false} is VALID [2018-11-18 22:26:53,056 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-18 22:26:53,056 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:26:53,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:26:53,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:26:53,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 22:26:53,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:26:53,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:26:53,081 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-18 22:26:53,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:26:53,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:26:53,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:26:53,082 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 5 states. [2018-11-18 22:26:54,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:54,691 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2018-11-18 22:26:54,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:26:54,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 22:26:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:26:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:26:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2018-11-18 22:26:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:26:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2018-11-18 22:26:54,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 176 transitions. [2018-11-18 22:26:55,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:26:55,014 INFO L225 Difference]: With dead ends: 155 [2018-11-18 22:26:55,015 INFO L226 Difference]: Without dead ends: 153 [2018-11-18 22:26:55,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:26:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-18 22:26:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 125. [2018-11-18 22:26:55,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:26:55,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 125 states. [2018-11-18 22:26:55,070 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 125 states. [2018-11-18 22:26:55,070 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 125 states. [2018-11-18 22:26:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:55,075 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2018-11-18 22:26:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2018-11-18 22:26:55,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:26:55,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:26:55,076 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 153 states. [2018-11-18 22:26:55,076 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 153 states. [2018-11-18 22:26:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:55,081 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2018-11-18 22:26:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2018-11-18 22:26:55,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:26:55,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:26:55,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:26:55,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:26:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-18 22:26:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2018-11-18 22:26:55,086 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 15 [2018-11-18 22:26:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:26:55,087 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2018-11-18 22:26:55,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:26:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2018-11-18 22:26:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 22:26:55,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:26:55,087 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:26:55,088 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:26:55,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:26:55,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2014242973, now seen corresponding path program 1 times [2018-11-18 22:26:55,089 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:26:55,089 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-18 22:26:55,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:26:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:55,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:26:55,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {2561#true} call ULTIMATE.init(); {2561#true} is VALID [2018-11-18 22:26:55,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {2561#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {2561#true} is VALID [2018-11-18 22:26:55,251 INFO L273 TraceCheckUtils]: 2: Hoare triple {2561#true} assume true; {2561#true} is VALID [2018-11-18 22:26:55,251 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2561#true} {2561#true} #388#return; {2561#true} is VALID [2018-11-18 22:26:55,251 INFO L256 TraceCheckUtils]: 4: Hoare triple {2561#true} call #t~ret15 := main(); {2561#true} is VALID [2018-11-18 22:26:55,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {2561#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2561#true} is VALID [2018-11-18 22:26:55,252 INFO L273 TraceCheckUtils]: 6: Hoare triple {2561#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {2584#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:55,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {2584#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {2584#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:55,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {2584#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {2584#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:55,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {2584#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {2584#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:55,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {2584#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {2597#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:26:55,258 INFO L273 TraceCheckUtils]: 11: Hoare triple {2597#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {2601#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:26:55,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {2601#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2601#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:26:55,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {2601#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2608#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:26:55,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {2608#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {2562#false} is VALID [2018-11-18 22:26:55,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {2562#false} assume !false; {2562#false} is VALID [2018-11-18 22:26:55,264 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-18 22:26:55,265 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:26:55,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:26:55,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:26:55,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-18 22:26:55,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:26:55,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:26:55,289 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-18 22:26:55,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:26:55,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:26:55,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:26:55,291 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand 6 states. [2018-11-18 22:26:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:56,691 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2018-11-18 22:26:56,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:26:56,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-18 22:26:56,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:26:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:26:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2018-11-18 22:26:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:26:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2018-11-18 22:26:56,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 174 transitions. [2018-11-18 22:26:56,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:26:56,981 INFO L225 Difference]: With dead ends: 153 [2018-11-18 22:26:56,981 INFO L226 Difference]: Without dead ends: 148 [2018-11-18 22:26:56,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:26:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-18 22:26:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 123. [2018-11-18 22:26:57,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:26:57,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 123 states. [2018-11-18 22:26:57,005 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 123 states. [2018-11-18 22:26:57,006 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 123 states. [2018-11-18 22:26:57,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:57,010 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2018-11-18 22:26:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2018-11-18 22:26:57,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:26:57,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:26:57,011 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 148 states. [2018-11-18 22:26:57,011 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 148 states. [2018-11-18 22:26:57,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:57,016 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2018-11-18 22:26:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2018-11-18 22:26:57,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:26:57,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:26:57,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:26:57,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:26:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 22:26:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-11-18 22:26:57,021 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 16 [2018-11-18 22:26:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:26:57,021 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-11-18 22:26:57,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:26:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-11-18 22:26:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 22:26:57,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:26:57,022 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:26:57,023 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:26:57,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:26:57,023 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2018-11-18 22:26:57,023 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:26:57,023 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-18 22:26:57,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:26:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:57,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:26:57,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {3208#true} call ULTIMATE.init(); {3208#true} is VALID [2018-11-18 22:26:57,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {3208#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {3208#true} is VALID [2018-11-18 22:26:57,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {3208#true} assume true; {3208#true} is VALID [2018-11-18 22:26:57,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3208#true} {3208#true} #388#return; {3208#true} is VALID [2018-11-18 22:26:57,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {3208#true} call #t~ret15 := main(); {3208#true} is VALID [2018-11-18 22:26:57,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {3208#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3208#true} is VALID [2018-11-18 22:26:57,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {3208#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {3231#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:57,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {3231#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3231#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:57,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {3231#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3231#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:57,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {3231#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3231#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:57,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {3231#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {3244#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:26:57,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {3244#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {3244#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:26:57,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {3244#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3251#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:26:57,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {3251#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3255#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:26:57,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {3255#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {3209#false} is VALID [2018-11-18 22:26:57,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {3209#false} assume !false; {3209#false} is VALID [2018-11-18 22:26:57,176 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-18 22:26:57,176 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:26:57,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:26:57,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:26:57,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-18 22:26:57,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:26:57,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:26:57,196 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-18 22:26:57,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:26:57,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:26:57,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:26:57,197 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 6 states. [2018-11-18 22:26:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:58,789 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2018-11-18 22:26:58,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:26:58,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-18 22:26:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:26:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:26:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2018-11-18 22:26:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:26:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2018-11-18 22:26:58,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 169 transitions. [2018-11-18 22:26:59,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:26:59,263 INFO L225 Difference]: With dead ends: 148 [2018-11-18 22:26:59,263 INFO L226 Difference]: Without dead ends: 144 [2018-11-18 22:26:59,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:26:59,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-18 22:26:59,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 122. [2018-11-18 22:26:59,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:26:59,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 122 states. [2018-11-18 22:26:59,275 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 122 states. [2018-11-18 22:26:59,275 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 122 states. [2018-11-18 22:26:59,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:59,279 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2018-11-18 22:26:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 165 transitions. [2018-11-18 22:26:59,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:26:59,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:26:59,280 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 144 states. [2018-11-18 22:26:59,280 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 144 states. [2018-11-18 22:26:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:26:59,285 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2018-11-18 22:26:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 165 transitions. [2018-11-18 22:26:59,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:26:59,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:26:59,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:26:59,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:26:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 22:26:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2018-11-18 22:26:59,290 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 16 [2018-11-18 22:26:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:26:59,290 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2018-11-18 22:26:59,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:26:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2018-11-18 22:26:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 22:26:59,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:26:59,291 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:26:59,292 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:26:59,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:26:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2018-11-18 22:26:59,293 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:26:59,293 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-18 22:26:59,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:26:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:26:59,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:26:59,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {3840#true} call ULTIMATE.init(); {3840#true} is VALID [2018-11-18 22:26:59,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {3840#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {3840#true} is VALID [2018-11-18 22:26:59,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {3840#true} assume true; {3840#true} is VALID [2018-11-18 22:26:59,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3840#true} {3840#true} #388#return; {3840#true} is VALID [2018-11-18 22:26:59,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {3840#true} call #t~ret15 := main(); {3840#true} is VALID [2018-11-18 22:26:59,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {3840#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3840#true} is VALID [2018-11-18 22:26:59,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {3840#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {3863#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:59,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {3863#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3863#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:59,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {3863#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3863#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:59,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {3863#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3863#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:26:59,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {3863#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {3876#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:26:59,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {3876#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {3876#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:26:59,638 INFO L273 TraceCheckUtils]: 12: Hoare triple {3876#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {3876#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:26:59,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {3876#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {3876#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:26:59,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {3876#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3889#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:26:59,666 INFO L273 TraceCheckUtils]: 15: Hoare triple {3889#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {3841#false} is VALID [2018-11-18 22:26:59,666 INFO L273 TraceCheckUtils]: 16: Hoare triple {3841#false} assume !false; {3841#false} is VALID [2018-11-18 22:26:59,667 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-18 22:26:59,667 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:26:59,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:26:59,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:26:59,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-18 22:26:59,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:26:59,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:26:59,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:26:59,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:26:59,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:26:59,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:26:59,691 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand 5 states. [2018-11-18 22:27:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:00,908 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2018-11-18 22:27:00,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:27:00,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-18 22:27:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:27:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2018-11-18 22:27:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:27:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2018-11-18 22:27:00,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 198 transitions. [2018-11-18 22:27:01,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:01,140 INFO L225 Difference]: With dead ends: 175 [2018-11-18 22:27:01,140 INFO L226 Difference]: Without dead ends: 173 [2018-11-18 22:27:01,141 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:27:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-18 22:27:01,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 125. [2018-11-18 22:27:01,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:01,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 125 states. [2018-11-18 22:27:01,157 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 125 states. [2018-11-18 22:27:01,157 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 125 states. [2018-11-18 22:27:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:01,164 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2018-11-18 22:27:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 196 transitions. [2018-11-18 22:27:01,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:01,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:01,165 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 173 states. [2018-11-18 22:27:01,165 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 173 states. [2018-11-18 22:27:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:01,171 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2018-11-18 22:27:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 196 transitions. [2018-11-18 22:27:01,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:01,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:01,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:01,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-18 22:27:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2018-11-18 22:27:01,176 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 17 [2018-11-18 22:27:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:01,176 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2018-11-18 22:27:01,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:27:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2018-11-18 22:27:01,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 22:27:01,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:01,177 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:01,177 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:01,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:01,178 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2018-11-18 22:27:01,178 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:01,178 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-18 22:27:01,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:01,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:01,313 INFO L256 TraceCheckUtils]: 0: Hoare triple {4564#true} call ULTIMATE.init(); {4564#true} is VALID [2018-11-18 22:27:01,313 INFO L273 TraceCheckUtils]: 1: Hoare triple {4564#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {4564#true} is VALID [2018-11-18 22:27:01,314 INFO L273 TraceCheckUtils]: 2: Hoare triple {4564#true} assume true; {4564#true} is VALID [2018-11-18 22:27:01,314 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4564#true} {4564#true} #388#return; {4564#true} is VALID [2018-11-18 22:27:01,315 INFO L256 TraceCheckUtils]: 4: Hoare triple {4564#true} call #t~ret15 := main(); {4564#true} is VALID [2018-11-18 22:27:01,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {4564#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4564#true} is VALID [2018-11-18 22:27:01,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {4564#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {4587#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:01,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {4587#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4587#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:01,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {4587#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4587#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:01,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {4587#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4587#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:01,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {4587#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {4600#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:01,365 INFO L273 TraceCheckUtils]: 11: Hoare triple {4600#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {4600#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:01,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {4600#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {4600#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:01,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {4600#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {4600#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:01,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {4600#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4613#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:01,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {4613#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~12; {4565#false} is VALID [2018-11-18 22:27:01,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {4565#false} assume !false; {4565#false} is VALID [2018-11-18 22:27:01,370 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-18 22:27:01,370 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:01,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:01,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:27:01,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-18 22:27:01,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:01,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:27:01,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:01,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:27:01,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:27:01,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:27:01,395 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand 5 states. [2018-11-18 22:27:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:03,387 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2018-11-18 22:27:03,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:27:03,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-18 22:27:03,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:27:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2018-11-18 22:27:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:27:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2018-11-18 22:27:03,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 163 transitions. [2018-11-18 22:27:03,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:03,659 INFO L225 Difference]: With dead ends: 142 [2018-11-18 22:27:03,659 INFO L226 Difference]: Without dead ends: 140 [2018-11-18 22:27:03,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:27:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-18 22:27:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2018-11-18 22:27:03,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:03,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 127 states. [2018-11-18 22:27:03,679 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 127 states. [2018-11-18 22:27:03,679 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 127 states. [2018-11-18 22:27:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:03,684 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-11-18 22:27:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-11-18 22:27:03,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:03,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:03,685 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 140 states. [2018-11-18 22:27:03,686 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 140 states. [2018-11-18 22:27:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:03,690 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-11-18 22:27:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-11-18 22:27:03,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:03,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:03,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:03,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-18 22:27:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2018-11-18 22:27:03,695 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 17 [2018-11-18 22:27:03,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:03,696 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2018-11-18 22:27:03,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:27:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2018-11-18 22:27:03,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 22:27:03,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:03,697 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:03,697 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:03,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:03,697 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2018-11-18 22:27:03,698 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:03,698 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-18 22:27:03,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:03,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:04,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {5189#true} call ULTIMATE.init(); {5189#true} is VALID [2018-11-18 22:27:04,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {5189#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {5189#true} is VALID [2018-11-18 22:27:04,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {5189#true} assume true; {5189#true} is VALID [2018-11-18 22:27:04,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5189#true} {5189#true} #388#return; {5189#true} is VALID [2018-11-18 22:27:04,249 INFO L256 TraceCheckUtils]: 4: Hoare triple {5189#true} call #t~ret15 := main(); {5189#true} is VALID [2018-11-18 22:27:04,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {5189#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5189#true} is VALID [2018-11-18 22:27:04,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {5189#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {5212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:04,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {5212#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {5216#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:04,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {5216#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5216#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:04,301 INFO L273 TraceCheckUtils]: 9: Hoare triple {5216#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5223#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-18 22:27:04,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {5223#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:04,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:04,337 INFO L273 TraceCheckUtils]: 12: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:04,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:04,363 INFO L273 TraceCheckUtils]: 14: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:04,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5243#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:04,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {5243#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {5190#false} is VALID [2018-11-18 22:27:04,388 INFO L273 TraceCheckUtils]: 17: Hoare triple {5190#false} assume !false; {5190#false} is VALID [2018-11-18 22:27:04,390 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-18 22:27:04,390 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:04,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:04,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:27:04,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-18 22:27:04,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:04,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:27:04,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:04,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:27:04,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:27:04,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:27:04,483 INFO L87 Difference]: Start difference. First operand 127 states and 149 transitions. Second operand 7 states. [2018-11-18 22:27:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:06,446 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2018-11-18 22:27:06,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:27:06,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-18 22:27:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2018-11-18 22:27:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2018-11-18 22:27:06,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 197 transitions. [2018-11-18 22:27:06,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:06,722 INFO L225 Difference]: With dead ends: 174 [2018-11-18 22:27:06,722 INFO L226 Difference]: Without dead ends: 172 [2018-11-18 22:27:06,722 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:27:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-18 22:27:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 128. [2018-11-18 22:27:06,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:06,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 128 states. [2018-11-18 22:27:06,747 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 128 states. [2018-11-18 22:27:06,747 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 128 states. [2018-11-18 22:27:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:06,751 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2018-11-18 22:27:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2018-11-18 22:27:06,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:06,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:06,752 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 172 states. [2018-11-18 22:27:06,752 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 172 states. [2018-11-18 22:27:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:06,755 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2018-11-18 22:27:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2018-11-18 22:27:06,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:06,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:06,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:06,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-18 22:27:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 150 transitions. [2018-11-18 22:27:06,759 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 150 transitions. Word has length 18 [2018-11-18 22:27:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:06,759 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 150 transitions. [2018-11-18 22:27:06,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:27:06,759 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 150 transitions. [2018-11-18 22:27:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 22:27:06,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:06,760 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:06,761 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:06,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2018-11-18 22:27:06,761 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:06,761 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-18 22:27:06,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:06,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:06,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {5918#true} call ULTIMATE.init(); {5918#true} is VALID [2018-11-18 22:27:06,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {5918#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {5918#true} is VALID [2018-11-18 22:27:06,883 INFO L273 TraceCheckUtils]: 2: Hoare triple {5918#true} assume true; {5918#true} is VALID [2018-11-18 22:27:06,883 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5918#true} {5918#true} #388#return; {5918#true} is VALID [2018-11-18 22:27:06,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {5918#true} call #t~ret15 := main(); {5918#true} is VALID [2018-11-18 22:27:06,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {5918#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5918#true} is VALID [2018-11-18 22:27:06,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {5918#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {5941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:06,885 INFO L273 TraceCheckUtils]: 7: Hoare triple {5941#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {5941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:06,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {5941#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:06,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {5941#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:06,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {5941#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:06,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:06,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:06,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:06,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:06,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5970#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:06,902 INFO L273 TraceCheckUtils]: 16: Hoare triple {5970#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {5919#false} is VALID [2018-11-18 22:27:06,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {5919#false} assume !false; {5919#false} is VALID [2018-11-18 22:27:06,903 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-18 22:27:06,903 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:06,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:06,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:27:06,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-18 22:27:06,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:06,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:27:06,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:06,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:27:06,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:27:06,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:27:06,944 INFO L87 Difference]: Start difference. First operand 128 states and 150 transitions. Second operand 5 states. [2018-11-18 22:27:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:08,392 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2018-11-18 22:27:08,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:27:08,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-18 22:27:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:08,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:27:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2018-11-18 22:27:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:27:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2018-11-18 22:27:08,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 192 transitions. [2018-11-18 22:27:09,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:09,009 INFO L225 Difference]: With dead ends: 169 [2018-11-18 22:27:09,009 INFO L226 Difference]: Without dead ends: 167 [2018-11-18 22:27:09,009 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:27:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-18 22:27:09,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 130. [2018-11-18 22:27:09,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:09,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 130 states. [2018-11-18 22:27:09,019 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 130 states. [2018-11-18 22:27:09,019 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 130 states. [2018-11-18 22:27:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:09,023 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2018-11-18 22:27:09,023 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2018-11-18 22:27:09,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:09,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:09,024 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 167 states. [2018-11-18 22:27:09,025 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 167 states. [2018-11-18 22:27:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:09,029 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2018-11-18 22:27:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2018-11-18 22:27:09,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:09,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:09,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:09,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 22:27:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2018-11-18 22:27:09,033 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 18 [2018-11-18 22:27:09,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:09,033 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2018-11-18 22:27:09,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:27:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2018-11-18 22:27:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 22:27:09,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:09,034 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:09,035 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:09,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:09,035 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2018-11-18 22:27:09,035 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:09,035 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-18 22:27:09,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:09,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:09,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {6633#true} call ULTIMATE.init(); {6633#true} is VALID [2018-11-18 22:27:09,763 INFO L273 TraceCheckUtils]: 1: Hoare triple {6633#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {6633#true} is VALID [2018-11-18 22:27:09,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {6633#true} assume true; {6633#true} is VALID [2018-11-18 22:27:09,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6633#true} {6633#true} #388#return; {6633#true} is VALID [2018-11-18 22:27:09,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {6633#true} call #t~ret15 := main(); {6633#true} is VALID [2018-11-18 22:27:09,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {6633#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {6633#true} is VALID [2018-11-18 22:27:09,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {6633#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {6656#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:09,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {6656#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {6660#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:09,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {6660#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6660#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:09,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {6660#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6667#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-18 22:27:09,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {6667#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:09,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:09,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:09,775 INFO L273 TraceCheckUtils]: 13: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:09,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:09,778 INFO L273 TraceCheckUtils]: 15: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {6687#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:09,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {6687#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~13; {6634#false} is VALID [2018-11-18 22:27:09,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {6634#false} assume !false; {6634#false} is VALID [2018-11-18 22:27:09,780 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-18 22:27:09,781 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:09,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:09,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:27:09,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-18 22:27:09,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:09,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:27:09,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:09,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:27:09,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:27:09,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:27:09,809 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand 7 states. [2018-11-18 22:27:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:11,011 INFO L93 Difference]: Finished difference Result 136 states and 157 transitions. [2018-11-18 22:27:11,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:27:11,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-18 22:27:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2018-11-18 22:27:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2018-11-18 22:27:11,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 157 transitions. [2018-11-18 22:27:11,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:11,191 INFO L225 Difference]: With dead ends: 136 [2018-11-18 22:27:11,191 INFO L226 Difference]: Without dead ends: 132 [2018-11-18 22:27:11,191 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:27:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-18 22:27:11,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2018-11-18 22:27:11,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:11,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 129 states. [2018-11-18 22:27:11,203 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 129 states. [2018-11-18 22:27:11,203 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 129 states. [2018-11-18 22:27:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:11,207 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2018-11-18 22:27:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2018-11-18 22:27:11,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:11,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:11,208 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 132 states. [2018-11-18 22:27:11,208 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 132 states. [2018-11-18 22:27:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:11,211 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2018-11-18 22:27:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2018-11-18 22:27:11,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:11,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:11,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:11,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-18 22:27:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-11-18 22:27:11,214 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 18 [2018-11-18 22:27:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:11,214 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-11-18 22:27:11,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:27:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-11-18 22:27:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 22:27:11,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:11,215 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:11,216 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:11,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:11,216 INFO L82 PathProgramCache]: Analyzing trace with hash -481853988, now seen corresponding path program 1 times [2018-11-18 22:27:11,216 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:11,217 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-18 22:27:11,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:11,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:11,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {7244#true} call ULTIMATE.init(); {7244#true} is VALID [2018-11-18 22:27:11,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {7244#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {7244#true} is VALID [2018-11-18 22:27:11,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {7244#true} assume true; {7244#true} is VALID [2018-11-18 22:27:11,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7244#true} {7244#true} #388#return; {7244#true} is VALID [2018-11-18 22:27:11,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {7244#true} call #t~ret15 := main(); {7244#true} is VALID [2018-11-18 22:27:11,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {7244#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {7244#true} is VALID [2018-11-18 22:27:11,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {7244#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {7267#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:11,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {7267#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {7267#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:11,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {7267#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {7267#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:11,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {7267#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {7267#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:11,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {7267#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {7280#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:11,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {7280#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {7280#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:11,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {7280#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {7280#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:11,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {7280#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {7280#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:11,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {7280#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {7293#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:11,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {7293#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {7293#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:11,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {7293#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7300#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:11,411 INFO L273 TraceCheckUtils]: 17: Hoare triple {7300#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {7245#false} is VALID [2018-11-18 22:27:11,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {7245#false} assume !false; {7245#false} is VALID [2018-11-18 22:27:11,412 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-18 22:27:11,412 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:11,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:11,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:27:11,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-18 22:27:11,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:11,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:27:11,499 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-18 22:27:11,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:27:11,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:27:11,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:27:11,500 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 6 states. [2018-11-18 22:27:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:13,249 INFO L93 Difference]: Finished difference Result 176 states and 198 transitions. [2018-11-18 22:27:13,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:27:13,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-18 22:27:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:27:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2018-11-18 22:27:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:27:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2018-11-18 22:27:13,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 198 transitions. [2018-11-18 22:27:13,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:13,506 INFO L225 Difference]: With dead ends: 176 [2018-11-18 22:27:13,507 INFO L226 Difference]: Without dead ends: 174 [2018-11-18 22:27:13,507 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:27:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-18 22:27:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 133. [2018-11-18 22:27:13,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:13,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 133 states. [2018-11-18 22:27:13,534 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 133 states. [2018-11-18 22:27:13,534 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 133 states. [2018-11-18 22:27:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:13,539 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2018-11-18 22:27:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2018-11-18 22:27:13,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:13,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:13,540 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 174 states. [2018-11-18 22:27:13,541 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 174 states. [2018-11-18 22:27:13,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:13,544 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2018-11-18 22:27:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2018-11-18 22:27:13,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:13,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:13,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:13,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-18 22:27:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2018-11-18 22:27:13,549 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 19 [2018-11-18 22:27:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:13,549 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2018-11-18 22:27:13,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:27:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2018-11-18 22:27:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 22:27:13,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:13,550 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:13,551 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:13,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:13,551 INFO L82 PathProgramCache]: Analyzing trace with hash 102497833, now seen corresponding path program 1 times [2018-11-18 22:27:13,551 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:13,552 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-18 22:27:13,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:13,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:13,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {7989#true} call ULTIMATE.init(); {7989#true} is VALID [2018-11-18 22:27:13,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {7989#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {7989#true} is VALID [2018-11-18 22:27:13,793 INFO L273 TraceCheckUtils]: 2: Hoare triple {7989#true} assume true; {7989#true} is VALID [2018-11-18 22:27:13,793 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7989#true} {7989#true} #388#return; {7989#true} is VALID [2018-11-18 22:27:13,793 INFO L256 TraceCheckUtils]: 4: Hoare triple {7989#true} call #t~ret15 := main(); {7989#true} is VALID [2018-11-18 22:27:13,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {7989#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {7989#true} is VALID [2018-11-18 22:27:13,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {7989#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {8012#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:13,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {8012#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {8012#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:13,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {8012#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {8012#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:13,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {8012#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {8012#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:13,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {8012#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8025#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:13,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {8025#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {8025#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:13,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {8025#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {8025#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:13,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {8025#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {8025#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:13,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {8025#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8038#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:13,812 INFO L273 TraceCheckUtils]: 15: Hoare triple {8038#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {8038#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:13,813 INFO L273 TraceCheckUtils]: 16: Hoare triple {8038#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8045#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:13,814 INFO L273 TraceCheckUtils]: 17: Hoare triple {8045#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {7990#false} is VALID [2018-11-18 22:27:13,814 INFO L273 TraceCheckUtils]: 18: Hoare triple {7990#false} assume !false; {7990#false} is VALID [2018-11-18 22:27:13,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-18 22:27:13,816 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:13,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:13,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:27:13,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-18 22:27:13,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:13,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:27:13,868 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-18 22:27:13,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:27:13,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:27:13,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:27:13,869 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand 6 states. [2018-11-18 22:27:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:15,531 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2018-11-18 22:27:15,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:27:15,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-18 22:27:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:27:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2018-11-18 22:27:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:27:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2018-11-18 22:27:15,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 196 transitions. [2018-11-18 22:27:15,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:15,757 INFO L225 Difference]: With dead ends: 174 [2018-11-18 22:27:15,757 INFO L226 Difference]: Without dead ends: 172 [2018-11-18 22:27:15,758 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:27:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-18 22:27:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 135. [2018-11-18 22:27:15,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:15,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 135 states. [2018-11-18 22:27:15,787 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 135 states. [2018-11-18 22:27:15,787 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 135 states. [2018-11-18 22:27:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:15,792 INFO L93 Difference]: Finished difference Result 172 states and 194 transitions. [2018-11-18 22:27:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 194 transitions. [2018-11-18 22:27:15,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:15,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:15,793 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 172 states. [2018-11-18 22:27:15,793 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 172 states. [2018-11-18 22:27:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:15,797 INFO L93 Difference]: Finished difference Result 172 states and 194 transitions. [2018-11-18 22:27:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 194 transitions. [2018-11-18 22:27:15,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:15,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:15,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:15,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 22:27:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2018-11-18 22:27:15,800 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 19 [2018-11-18 22:27:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:15,800 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2018-11-18 22:27:15,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:27:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2018-11-18 22:27:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 22:27:15,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:15,801 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:15,802 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:15,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:15,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2018-11-18 22:27:15,802 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:15,803 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-18 22:27:15,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:15,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:16,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {8731#true} call ULTIMATE.init(); {8731#true} is VALID [2018-11-18 22:27:16,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {8731#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {8731#true} is VALID [2018-11-18 22:27:16,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {8731#true} assume true; {8731#true} is VALID [2018-11-18 22:27:16,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8731#true} {8731#true} #388#return; {8731#true} is VALID [2018-11-18 22:27:16,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {8731#true} call #t~ret15 := main(); {8731#true} is VALID [2018-11-18 22:27:16,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {8731#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {8731#true} is VALID [2018-11-18 22:27:16,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {8731#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {8754#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:16,168 INFO L273 TraceCheckUtils]: 7: Hoare triple {8754#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {8758#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:16,168 INFO L273 TraceCheckUtils]: 8: Hoare triple {8758#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8758#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:16,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {8758#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8765#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-18 22:27:16,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {8765#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:16,172 INFO L273 TraceCheckUtils]: 11: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:16,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:16,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:16,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:16,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:16,177 INFO L273 TraceCheckUtils]: 16: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8788#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:16,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {8788#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {8732#false} is VALID [2018-11-18 22:27:16,178 INFO L273 TraceCheckUtils]: 18: Hoare triple {8732#false} assume !false; {8732#false} is VALID [2018-11-18 22:27:16,179 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-18 22:27:16,180 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:16,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:16,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:27:16,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-18 22:27:16,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:16,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:27:16,231 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-18 22:27:16,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:27:16,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:27:16,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:27:16,232 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand 7 states. [2018-11-18 22:27:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:17,607 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2018-11-18 22:27:17,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:27:17,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-18 22:27:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2018-11-18 22:27:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2018-11-18 22:27:17,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 187 transitions. [2018-11-18 22:27:17,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:17,868 INFO L225 Difference]: With dead ends: 169 [2018-11-18 22:27:17,868 INFO L226 Difference]: Without dead ends: 167 [2018-11-18 22:27:17,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:27:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-18 22:27:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 135. [2018-11-18 22:27:17,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:17,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 135 states. [2018-11-18 22:27:17,901 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 135 states. [2018-11-18 22:27:17,901 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 135 states. [2018-11-18 22:27:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:17,904 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2018-11-18 22:27:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 191 transitions. [2018-11-18 22:27:17,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:17,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:17,904 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 167 states. [2018-11-18 22:27:17,904 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 167 states. [2018-11-18 22:27:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:17,907 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2018-11-18 22:27:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 191 transitions. [2018-11-18 22:27:17,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:17,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:17,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:17,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 22:27:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2018-11-18 22:27:17,909 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 19 [2018-11-18 22:27:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:17,910 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2018-11-18 22:27:17,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:27:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2018-11-18 22:27:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 22:27:17,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:17,910 INFO L375 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-18 22:27:17,911 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:17,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2052568648, now seen corresponding path program 1 times [2018-11-18 22:27:17,911 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:17,911 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-18 22:27:17,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:17,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:18,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {9460#true} call ULTIMATE.init(); {9460#true} is VALID [2018-11-18 22:27:18,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {9460#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {9460#true} is VALID [2018-11-18 22:27:18,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {9460#true} assume true; {9460#true} is VALID [2018-11-18 22:27:18,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9460#true} {9460#true} #388#return; {9460#true} is VALID [2018-11-18 22:27:18,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {9460#true} call #t~ret15 := main(); {9460#true} is VALID [2018-11-18 22:27:18,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {9460#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {9460#true} is VALID [2018-11-18 22:27:18,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {9460#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {9483#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:18,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {9483#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {9483#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:18,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {9483#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {9483#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:18,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {9483#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {9483#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:18,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {9483#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {9496#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:18,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {9496#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {9496#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:18,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {9496#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9496#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:18,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {9496#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9496#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:18,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {9496#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {9509#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:18,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {9509#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {9509#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:18,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {9509#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9516#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:27:18,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {9516#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9520#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:18,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {9520#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {9461#false} is VALID [2018-11-18 22:27:18,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {9461#false} assume !false; {9461#false} is VALID [2018-11-18 22:27:18,078 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-18 22:27:18,078 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:18,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:18,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:27:18,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-18 22:27:18,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:18,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:27:18,104 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-18 22:27:18,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:27:18,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:27:18,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:27:18,105 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand 7 states. [2018-11-18 22:27:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:19,854 INFO L93 Difference]: Finished difference Result 170 states and 192 transitions. [2018-11-18 22:27:19,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:27:19,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-18 22:27:19,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2018-11-18 22:27:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2018-11-18 22:27:19,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 192 transitions. [2018-11-18 22:27:20,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:20,093 INFO L225 Difference]: With dead ends: 170 [2018-11-18 22:27:20,094 INFO L226 Difference]: Without dead ends: 166 [2018-11-18 22:27:20,094 INFO L604 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-18 22:27:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-18 22:27:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 134. [2018-11-18 22:27:20,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:20,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 134 states. [2018-11-18 22:27:20,121 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 134 states. [2018-11-18 22:27:20,121 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 134 states. [2018-11-18 22:27:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:20,124 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2018-11-18 22:27:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2018-11-18 22:27:20,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:20,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:20,125 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 166 states. [2018-11-18 22:27:20,125 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 166 states. [2018-11-18 22:27:20,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:20,128 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2018-11-18 22:27:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2018-11-18 22:27:20,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:20,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:20,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:20,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-18 22:27:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2018-11-18 22:27:20,132 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 20 [2018-11-18 22:27:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:20,132 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2018-11-18 22:27:20,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:27:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2018-11-18 22:27:20,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 22:27:20,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:20,133 INFO L375 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-18 22:27:20,134 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:20,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:20,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1117531412, now seen corresponding path program 1 times [2018-11-18 22:27:20,134 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:20,134 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-18 22:27:20,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:20,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:20,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {10189#true} call ULTIMATE.init(); {10189#true} is VALID [2018-11-18 22:27:20,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {10189#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {10189#true} is VALID [2018-11-18 22:27:20,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {10189#true} assume true; {10189#true} is VALID [2018-11-18 22:27:20,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10189#true} {10189#true} #388#return; {10189#true} is VALID [2018-11-18 22:27:20,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {10189#true} call #t~ret15 := main(); {10189#true} is VALID [2018-11-18 22:27:20,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {10189#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {10189#true} is VALID [2018-11-18 22:27:20,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {10189#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {10212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:20,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {10212#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {10212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:20,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {10212#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {10212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:20,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {10212#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {10212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:20,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {10212#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {10225#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:20,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {10225#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {10225#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:20,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {10225#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {10225#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:20,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {10225#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {10225#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:20,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {10225#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {10238#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:20,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {10238#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {10242#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:27:20,375 INFO L273 TraceCheckUtils]: 16: Hoare triple {10242#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10242#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:27:20,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {10242#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10249#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:20,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {10249#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {10190#false} is VALID [2018-11-18 22:27:20,377 INFO L273 TraceCheckUtils]: 19: Hoare triple {10190#false} assume !false; {10190#false} is VALID [2018-11-18 22:27:20,378 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-18 22:27:20,378 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:20,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:20,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:27:20,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-18 22:27:20,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:20,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:27:20,409 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-18 22:27:20,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:27:20,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:27:20,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:27:20,410 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand 7 states. [2018-11-18 22:27:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:22,329 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2018-11-18 22:27:22,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:27:22,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-18 22:27:22,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2018-11-18 22:27:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2018-11-18 22:27:22,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 188 transitions. [2018-11-18 22:27:22,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:22,561 INFO L225 Difference]: With dead ends: 166 [2018-11-18 22:27:22,561 INFO L226 Difference]: Without dead ends: 161 [2018-11-18 22:27:22,562 INFO L604 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-18 22:27:22,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-18 22:27:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 132. [2018-11-18 22:27:22,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:22,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 132 states. [2018-11-18 22:27:22,612 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 132 states. [2018-11-18 22:27:22,613 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 132 states. [2018-11-18 22:27:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:22,615 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-11-18 22:27:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2018-11-18 22:27:22,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:22,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:22,616 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 161 states. [2018-11-18 22:27:22,617 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 161 states. [2018-11-18 22:27:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:22,620 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-11-18 22:27:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2018-11-18 22:27:22,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:22,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:22,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:22,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-18 22:27:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2018-11-18 22:27:22,623 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 20 [2018-11-18 22:27:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:22,624 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2018-11-18 22:27:22,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:27:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2018-11-18 22:27:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 22:27:22,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:22,625 INFO L375 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-18 22:27:22,625 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:22,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2018-11-18 22:27:22,626 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:22,626 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-18 22:27:22,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:22,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:22,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {10901#true} call ULTIMATE.init(); {10901#true} is VALID [2018-11-18 22:27:22,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {10901#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {10901#true} is VALID [2018-11-18 22:27:22,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {10901#true} assume true; {10901#true} is VALID [2018-11-18 22:27:22,805 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10901#true} {10901#true} #388#return; {10901#true} is VALID [2018-11-18 22:27:22,805 INFO L256 TraceCheckUtils]: 4: Hoare triple {10901#true} call #t~ret15 := main(); {10901#true} is VALID [2018-11-18 22:27:22,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {10901#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {10901#true} is VALID [2018-11-18 22:27:22,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {10901#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {10924#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:22,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {10924#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {10924#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:22,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {10924#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10924#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:22,808 INFO L273 TraceCheckUtils]: 9: Hoare triple {10924#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10924#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:22,809 INFO L273 TraceCheckUtils]: 10: Hoare triple {10924#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:22,809 INFO L273 TraceCheckUtils]: 11: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:22,810 INFO L273 TraceCheckUtils]: 12: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:22,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:22,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:22,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:22,812 INFO L273 TraceCheckUtils]: 16: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {10956#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:22,813 INFO L273 TraceCheckUtils]: 17: Hoare triple {10956#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10960#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:22,814 INFO L273 TraceCheckUtils]: 18: Hoare triple {10960#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {10902#false} is VALID [2018-11-18 22:27:22,814 INFO L273 TraceCheckUtils]: 19: Hoare triple {10902#false} assume !false; {10902#false} is VALID [2018-11-18 22:27:22,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-18 22:27:22,815 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:22,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:22,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:27:22,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-18 22:27:22,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:22,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:27:22,844 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-18 22:27:22,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:27:22,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:27:22,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:27:22,845 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand 6 states. [2018-11-18 22:27:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:24,364 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-11-18 22:27:24,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:27:24,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-18 22:27:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:27:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2018-11-18 22:27:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:27:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2018-11-18 22:27:24,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 183 transitions. [2018-11-18 22:27:24,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:24,571 INFO L225 Difference]: With dead ends: 161 [2018-11-18 22:27:24,571 INFO L226 Difference]: Without dead ends: 159 [2018-11-18 22:27:24,572 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:27:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-18 22:27:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2018-11-18 22:27:24,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:24,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 134 states. [2018-11-18 22:27:24,579 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 134 states. [2018-11-18 22:27:24,580 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 134 states. [2018-11-18 22:27:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:24,583 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2018-11-18 22:27:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2018-11-18 22:27:24,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:24,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:24,584 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 159 states. [2018-11-18 22:27:24,584 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 159 states. [2018-11-18 22:27:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:24,587 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2018-11-18 22:27:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2018-11-18 22:27:24,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:24,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:24,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:24,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-18 22:27:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2018-11-18 22:27:24,591 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 20 [2018-11-18 22:27:24,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:24,591 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2018-11-18 22:27:24,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:27:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2018-11-18 22:27:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 22:27:24,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:24,592 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:24,592 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:24,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:24,593 INFO L82 PathProgramCache]: Analyzing trace with hash 808149389, now seen corresponding path program 1 times [2018-11-18 22:27:24,593 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:24,593 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-18 22:27:24,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:24,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:24,726 INFO L256 TraceCheckUtils]: 0: Hoare triple {11604#true} call ULTIMATE.init(); {11604#true} is VALID [2018-11-18 22:27:24,726 INFO L273 TraceCheckUtils]: 1: Hoare triple {11604#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {11604#true} is VALID [2018-11-18 22:27:24,726 INFO L273 TraceCheckUtils]: 2: Hoare triple {11604#true} assume true; {11604#true} is VALID [2018-11-18 22:27:24,726 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11604#true} {11604#true} #388#return; {11604#true} is VALID [2018-11-18 22:27:24,727 INFO L256 TraceCheckUtils]: 4: Hoare triple {11604#true} call #t~ret15 := main(); {11604#true} is VALID [2018-11-18 22:27:24,727 INFO L273 TraceCheckUtils]: 5: Hoare triple {11604#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {11604#true} is VALID [2018-11-18 22:27:24,727 INFO L273 TraceCheckUtils]: 6: Hoare triple {11604#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {11627#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:24,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {11627#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {11627#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:24,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {11627#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {11627#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:24,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {11627#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {11627#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:24,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {11627#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11640#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:24,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {11640#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {11640#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:24,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {11640#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {11640#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:24,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {11640#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {11640#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:24,734 INFO L273 TraceCheckUtils]: 14: Hoare triple {11640#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {11653#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:24,740 INFO L273 TraceCheckUtils]: 15: Hoare triple {11653#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {11653#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:24,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {11653#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {11653#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:24,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {11653#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {11653#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:24,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {11653#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {11666#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:24,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {11666#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {11605#false} is VALID [2018-11-18 22:27:24,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {11605#false} assume !false; {11605#false} is VALID [2018-11-18 22:27:24,745 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-18 22:27:24,746 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:24,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:24,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:27:24,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-18 22:27:24,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:24,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:27:24,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:24,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:27:24,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:27:24,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:27:24,774 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand 6 states. [2018-11-18 22:27:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:26,391 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2018-11-18 22:27:26,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:27:26,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-18 22:27:26,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:27:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2018-11-18 22:27:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:27:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2018-11-18 22:27:26,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 221 transitions. [2018-11-18 22:27:26,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:26,637 INFO L225 Difference]: With dead ends: 197 [2018-11-18 22:27:26,637 INFO L226 Difference]: Without dead ends: 195 [2018-11-18 22:27:26,637 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:27:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-18 22:27:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 137. [2018-11-18 22:27:26,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:26,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand 137 states. [2018-11-18 22:27:26,701 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 137 states. [2018-11-18 22:27:26,703 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 137 states. [2018-11-18 22:27:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:26,706 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2018-11-18 22:27:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 219 transitions. [2018-11-18 22:27:26,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:26,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:26,707 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 195 states. [2018-11-18 22:27:26,707 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 195 states. [2018-11-18 22:27:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:26,711 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2018-11-18 22:27:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 219 transitions. [2018-11-18 22:27:26,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:26,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:26,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:26,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-18 22:27:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2018-11-18 22:27:26,714 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 21 [2018-11-18 22:27:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:26,714 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2018-11-18 22:27:26,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:27:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2018-11-18 22:27:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 22:27:26,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:26,715 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:26,715 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:26,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:26,715 INFO L82 PathProgramCache]: Analyzing trace with hash 809688589, now seen corresponding path program 1 times [2018-11-18 22:27:26,715 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:26,715 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-18 22:27:26,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:26,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:26,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {12426#true} call ULTIMATE.init(); {12426#true} is VALID [2018-11-18 22:27:26,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {12426#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {12426#true} is VALID [2018-11-18 22:27:26,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {12426#true} assume true; {12426#true} is VALID [2018-11-18 22:27:26,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12426#true} {12426#true} #388#return; {12426#true} is VALID [2018-11-18 22:27:26,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {12426#true} call #t~ret15 := main(); {12426#true} is VALID [2018-11-18 22:27:26,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {12426#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {12426#true} is VALID [2018-11-18 22:27:26,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {12426#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {12449#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:26,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {12449#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {12449#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:26,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {12449#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {12449#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:26,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {12449#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {12449#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:26,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {12449#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {12462#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:26,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {12462#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {12462#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:26,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {12462#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {12462#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:26,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {12462#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {12462#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:26,857 INFO L273 TraceCheckUtils]: 14: Hoare triple {12462#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {12475#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:26,857 INFO L273 TraceCheckUtils]: 15: Hoare triple {12475#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {12475#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:26,858 INFO L273 TraceCheckUtils]: 16: Hoare triple {12475#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {12475#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:26,858 INFO L273 TraceCheckUtils]: 17: Hoare triple {12475#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {12475#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:26,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {12475#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {12488#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:26,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {12488#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~12; {12427#false} is VALID [2018-11-18 22:27:26,860 INFO L273 TraceCheckUtils]: 20: Hoare triple {12427#false} assume !false; {12427#false} is VALID [2018-11-18 22:27:26,861 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-18 22:27:26,861 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:26,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:26,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:27:26,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-18 22:27:26,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:26,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:27:26,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:26,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:27:26,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:27:26,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:27:26,929 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand 6 states. [2018-11-18 22:27:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:28,437 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-11-18 22:27:28,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:27:28,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-18 22:27:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:27:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2018-11-18 22:27:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:27:28,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2018-11-18 22:27:28,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 179 transitions. [2018-11-18 22:27:28,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:28,728 INFO L225 Difference]: With dead ends: 157 [2018-11-18 22:27:28,728 INFO L226 Difference]: Without dead ends: 155 [2018-11-18 22:27:28,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:27:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-18 22:27:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 139. [2018-11-18 22:27:28,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:28,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 139 states. [2018-11-18 22:27:28,736 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 139 states. [2018-11-18 22:27:28,736 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 139 states. [2018-11-18 22:27:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:28,740 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2018-11-18 22:27:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2018-11-18 22:27:28,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:28,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:28,741 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 155 states. [2018-11-18 22:27:28,741 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 155 states. [2018-11-18 22:27:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:28,744 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2018-11-18 22:27:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2018-11-18 22:27:28,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:28,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:28,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:28,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 22:27:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2018-11-18 22:27:28,747 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 21 [2018-11-18 22:27:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:28,747 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2018-11-18 22:27:28,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:27:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2018-11-18 22:27:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 22:27:28,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:28,748 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:28,748 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:28,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:28,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1797106325, now seen corresponding path program 1 times [2018-11-18 22:27:28,749 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:28,749 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-18 22:27:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:28,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:28,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {13125#true} call ULTIMATE.init(); {13125#true} is VALID [2018-11-18 22:27:28,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {13125#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {13125#true} is VALID [2018-11-18 22:27:28,981 INFO L273 TraceCheckUtils]: 2: Hoare triple {13125#true} assume true; {13125#true} is VALID [2018-11-18 22:27:28,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13125#true} {13125#true} #388#return; {13125#true} is VALID [2018-11-18 22:27:28,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {13125#true} call #t~ret15 := main(); {13125#true} is VALID [2018-11-18 22:27:28,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {13125#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {13125#true} is VALID [2018-11-18 22:27:28,983 INFO L273 TraceCheckUtils]: 6: Hoare triple {13125#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {13148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:28,983 INFO L273 TraceCheckUtils]: 7: Hoare triple {13148#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {13148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:28,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {13148#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {13148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:28,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {13148#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {13148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:28,987 INFO L273 TraceCheckUtils]: 10: Hoare triple {13148#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:28,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:28,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:28,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:28,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:28,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:28,990 INFO L273 TraceCheckUtils]: 16: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {13180#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:28,990 INFO L273 TraceCheckUtils]: 17: Hoare triple {13180#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {13180#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:28,991 INFO L273 TraceCheckUtils]: 18: Hoare triple {13180#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {13187#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:28,991 INFO L273 TraceCheckUtils]: 19: Hoare triple {13187#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {13126#false} is VALID [2018-11-18 22:27:28,992 INFO L273 TraceCheckUtils]: 20: Hoare triple {13126#false} assume !false; {13126#false} is VALID [2018-11-18 22:27:28,993 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-18 22:27:28,993 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (21)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 22:27:28,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:28,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:27:28,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-18 22:27:28,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:28,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:27:29,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:29,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:27:29,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:27:29,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:27:29,059 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand 6 states. [2018-11-18 22:27:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:30,811 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions. [2018-11-18 22:27:30,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:27:30,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-18 22:27:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:27:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2018-11-18 22:27:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:27:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2018-11-18 22:27:30,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 226 transitions. [2018-11-18 22:27:31,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:31,095 INFO L225 Difference]: With dead ends: 200 [2018-11-18 22:27:31,095 INFO L226 Difference]: Without dead ends: 198 [2018-11-18 22:27:31,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:27:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-18 22:27:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 141. [2018-11-18 22:27:31,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:31,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand 141 states. [2018-11-18 22:27:31,109 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 141 states. [2018-11-18 22:27:31,109 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 141 states. [2018-11-18 22:27:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:31,113 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2018-11-18 22:27:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 224 transitions. [2018-11-18 22:27:31,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:31,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:31,114 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 198 states. [2018-11-18 22:27:31,114 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 198 states. [2018-11-18 22:27:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:31,117 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2018-11-18 22:27:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 224 transitions. [2018-11-18 22:27:31,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:31,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:31,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:31,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-18 22:27:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 165 transitions. [2018-11-18 22:27:31,121 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 165 transitions. Word has length 21 [2018-11-18 22:27:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:31,121 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 165 transitions. [2018-11-18 22:27:31,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:27:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2018-11-18 22:27:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 22:27:31,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:31,122 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:31,122 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:31,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:31,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2018-11-18 22:27:31,123 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:31,123 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-18 22:27:31,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:31,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:31,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {13962#true} call ULTIMATE.init(); {13962#true} is VALID [2018-11-18 22:27:31,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {13962#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {13962#true} is VALID [2018-11-18 22:27:31,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {13962#true} assume true; {13962#true} is VALID [2018-11-18 22:27:31,276 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13962#true} {13962#true} #388#return; {13962#true} is VALID [2018-11-18 22:27:31,277 INFO L256 TraceCheckUtils]: 4: Hoare triple {13962#true} call #t~ret15 := main(); {13962#true} is VALID [2018-11-18 22:27:31,277 INFO L273 TraceCheckUtils]: 5: Hoare triple {13962#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {13962#true} is VALID [2018-11-18 22:27:31,278 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {13985#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:31,279 INFO L273 TraceCheckUtils]: 7: Hoare triple {13985#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {13985#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:31,279 INFO L273 TraceCheckUtils]: 8: Hoare triple {13985#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {13985#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:31,280 INFO L273 TraceCheckUtils]: 9: Hoare triple {13985#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {13985#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:31,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {13985#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:31,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:31,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:31,282 INFO L273 TraceCheckUtils]: 13: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:31,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:31,283 INFO L273 TraceCheckUtils]: 15: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:31,284 INFO L273 TraceCheckUtils]: 16: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {14017#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:31,285 INFO L273 TraceCheckUtils]: 17: Hoare triple {14017#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {14021#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:27:31,285 INFO L273 TraceCheckUtils]: 18: Hoare triple {14021#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {14025#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:31,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {14025#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {13963#false} is VALID [2018-11-18 22:27:31,287 INFO L273 TraceCheckUtils]: 20: Hoare triple {13963#false} assume !false; {13963#false} is VALID [2018-11-18 22:27:31,287 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-18 22:27:31,288 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:31,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:31,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:27:31,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-18 22:27:31,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:31,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:27:31,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:31,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:27:31,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:27:31,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:27:31,317 INFO L87 Difference]: Start difference. First operand 141 states and 165 transitions. Second operand 7 states. [2018-11-18 22:27:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:32,881 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2018-11-18 22:27:32,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:27:32,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-18 22:27:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2018-11-18 22:27:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2018-11-18 22:27:32,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 175 transitions. [2018-11-18 22:27:33,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:33,075 INFO L225 Difference]: With dead ends: 153 [2018-11-18 22:27:33,075 INFO L226 Difference]: Without dead ends: 149 [2018-11-18 22:27:33,075 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:27:33,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-18 22:27:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 140. [2018-11-18 22:27:33,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:33,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 140 states. [2018-11-18 22:27:33,085 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 140 states. [2018-11-18 22:27:33,085 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 140 states. [2018-11-18 22:27:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:33,088 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2018-11-18 22:27:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2018-11-18 22:27:33,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:33,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:33,089 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 149 states. [2018-11-18 22:27:33,089 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 149 states. [2018-11-18 22:27:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:33,092 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2018-11-18 22:27:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2018-11-18 22:27:33,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:33,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:33,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:33,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 22:27:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2018-11-18 22:27:33,094 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 21 [2018-11-18 22:27:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:33,095 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2018-11-18 22:27:33,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:27:33,095 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2018-11-18 22:27:33,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 22:27:33,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:33,095 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:33,096 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:33,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:33,096 INFO L82 PathProgramCache]: Analyzing trace with hash -717169605, now seen corresponding path program 1 times [2018-11-18 22:27:33,097 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:33,097 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-18 22:27:33,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:33,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:33,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {14648#true} call ULTIMATE.init(); {14648#true} is VALID [2018-11-18 22:27:33,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {14648#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {14648#true} is VALID [2018-11-18 22:27:33,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {14648#true} assume true; {14648#true} is VALID [2018-11-18 22:27:33,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14648#true} {14648#true} #388#return; {14648#true} is VALID [2018-11-18 22:27:33,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {14648#true} call #t~ret15 := main(); {14648#true} is VALID [2018-11-18 22:27:33,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {14648#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {14648#true} is VALID [2018-11-18 22:27:33,464 INFO L273 TraceCheckUtils]: 6: Hoare triple {14648#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {14671#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:33,466 INFO L273 TraceCheckUtils]: 7: Hoare triple {14671#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {14675#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:33,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {14675#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {14675#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:33,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {14675#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {14682#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:33,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {14682#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {14686#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:33,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {14686#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:33,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:33,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:33,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:33,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:33,478 INFO L273 TraceCheckUtils]: 16: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:33,479 INFO L273 TraceCheckUtils]: 17: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:33,480 INFO L273 TraceCheckUtils]: 18: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:33,482 INFO L273 TraceCheckUtils]: 19: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {14716#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:33,482 INFO L273 TraceCheckUtils]: 20: Hoare triple {14716#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {14649#false} is VALID [2018-11-18 22:27:33,483 INFO L273 TraceCheckUtils]: 21: Hoare triple {14649#false} assume !false; {14649#false} is VALID [2018-11-18 22:27:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:27:33,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:33,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:33,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 22:27:33,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-18 22:27:33,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:33,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:27:33,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:33,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:27:33,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:27:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:27:33,517 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand 9 states. [2018-11-18 22:27:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:36,306 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2018-11-18 22:27:36,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:27:36,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-18 22:27:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:27:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2018-11-18 22:27:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:27:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2018-11-18 22:27:36,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 194 transitions. [2018-11-18 22:27:36,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:36,535 INFO L225 Difference]: With dead ends: 192 [2018-11-18 22:27:36,535 INFO L226 Difference]: Without dead ends: 190 [2018-11-18 22:27:36,536 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:27:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-18 22:27:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 146. [2018-11-18 22:27:36,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:36,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 146 states. [2018-11-18 22:27:36,813 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 146 states. [2018-11-18 22:27:36,814 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 146 states. [2018-11-18 22:27:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:36,819 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2018-11-18 22:27:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 217 transitions. [2018-11-18 22:27:36,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:36,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:36,820 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 190 states. [2018-11-18 22:27:36,820 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 190 states. [2018-11-18 22:27:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:36,823 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2018-11-18 22:27:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 217 transitions. [2018-11-18 22:27:36,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:36,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:36,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:36,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 22:27:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2018-11-18 22:27:36,826 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 22 [2018-11-18 22:27:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:36,827 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2018-11-18 22:27:36,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:27:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2018-11-18 22:27:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 22:27:36,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:36,827 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:36,828 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:36,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:36,828 INFO L82 PathProgramCache]: Analyzing trace with hash -669454355, now seen corresponding path program 1 times [2018-11-18 22:27:36,828 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:36,829 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-18 22:27:36,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:36,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:37,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {15471#true} call ULTIMATE.init(); {15471#true} is VALID [2018-11-18 22:27:37,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {15471#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {15471#true} is VALID [2018-11-18 22:27:37,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {15471#true} assume true; {15471#true} is VALID [2018-11-18 22:27:37,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15471#true} {15471#true} #388#return; {15471#true} is VALID [2018-11-18 22:27:37,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {15471#true} call #t~ret15 := main(); {15471#true} is VALID [2018-11-18 22:27:37,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {15471#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {15471#true} is VALID [2018-11-18 22:27:37,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {15471#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {15494#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:37,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {15494#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {15498#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:37,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {15498#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {15498#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:37,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {15498#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {15505#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:37,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {15505#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {15509#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:37,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {15509#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:37,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:37,128 INFO L273 TraceCheckUtils]: 13: Hoare triple {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:37,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:37,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:37,151 INFO L273 TraceCheckUtils]: 16: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:37,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:37,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:37,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {15539#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:37,159 INFO L273 TraceCheckUtils]: 20: Hoare triple {15539#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~13; {15472#false} is VALID [2018-11-18 22:27:37,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {15472#false} assume !false; {15472#false} is VALID [2018-11-18 22:27:37,160 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-18 22:27:37,160 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:37,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:37,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 22:27:37,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-18 22:27:37,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:37,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:27:37,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:37,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:27:37,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:27:37,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:27:37,201 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand 9 states. [2018-11-18 22:27:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:39,300 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2018-11-18 22:27:39,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:27:39,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-18 22:27:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:27:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2018-11-18 22:27:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:27:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2018-11-18 22:27:39,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 156 transitions. [2018-11-18 22:27:39,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:39,544 INFO L225 Difference]: With dead ends: 156 [2018-11-18 22:27:39,544 INFO L226 Difference]: Without dead ends: 152 [2018-11-18 22:27:39,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:27:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-18 22:27:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2018-11-18 22:27:39,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:39,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 147 states. [2018-11-18 22:27:39,584 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 147 states. [2018-11-18 22:27:39,585 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 147 states. [2018-11-18 22:27:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:39,588 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2018-11-18 22:27:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2018-11-18 22:27:39,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:39,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:39,588 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 152 states. [2018-11-18 22:27:39,588 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 152 states. [2018-11-18 22:27:39,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:39,591 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2018-11-18 22:27:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2018-11-18 22:27:39,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:39,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:39,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:39,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-18 22:27:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2018-11-18 22:27:39,594 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 22 [2018-11-18 22:27:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:39,594 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2018-11-18 22:27:39,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:27:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2018-11-18 22:27:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 22:27:39,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:39,595 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:27:39,596 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:39,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:39,596 INFO L82 PathProgramCache]: Analyzing trace with hash 124281916, now seen corresponding path program 1 times [2018-11-18 22:27:39,596 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:39,596 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-18 22:27:39,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:39,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:39,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {16181#true} call ULTIMATE.init(); {16181#true} is VALID [2018-11-18 22:27:39,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {16181#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {16181#true} is VALID [2018-11-18 22:27:39,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {16181#true} assume true; {16181#true} is VALID [2018-11-18 22:27:39,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16181#true} {16181#true} #388#return; {16181#true} is VALID [2018-11-18 22:27:39,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {16181#true} call #t~ret15 := main(); {16181#true} is VALID [2018-11-18 22:27:39,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {16181#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {16181#true} is VALID [2018-11-18 22:27:39,942 INFO L273 TraceCheckUtils]: 6: Hoare triple {16181#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {16204#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:39,943 INFO L273 TraceCheckUtils]: 7: Hoare triple {16204#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {16208#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:39,943 INFO L273 TraceCheckUtils]: 8: Hoare triple {16208#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {16208#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:39,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {16208#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {16215#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-18 22:27:39,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {16215#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {16219#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:39,947 INFO L273 TraceCheckUtils]: 11: Hoare triple {16219#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {16219#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:39,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {16219#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:39,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:39,949 INFO L273 TraceCheckUtils]: 14: Hoare triple {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:39,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:39,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:39,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0); {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:39,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:39,955 INFO L273 TraceCheckUtils]: 19: Hoare triple {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {16249#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:39,956 INFO L273 TraceCheckUtils]: 20: Hoare triple {16249#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {16182#false} is VALID [2018-11-18 22:27:39,956 INFO L273 TraceCheckUtils]: 21: Hoare triple {16182#false} assume !false; {16182#false} is VALID [2018-11-18 22:27:39,958 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-18 22:27:39,958 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:39,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:39,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 22:27:39,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-18 22:27:39,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:39,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:27:39,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:39,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:27:39,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:27:39,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:27:39,990 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 9 states. [2018-11-18 22:27:42,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:42,681 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2018-11-18 22:27:42,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:27:42,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-18 22:27:42,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:27:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2018-11-18 22:27:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:27:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2018-11-18 22:27:42,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 209 transitions. [2018-11-18 22:27:42,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:42,937 INFO L225 Difference]: With dead ends: 194 [2018-11-18 22:27:42,938 INFO L226 Difference]: Without dead ends: 192 [2018-11-18 22:27:42,938 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:27:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-18 22:27:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 150. [2018-11-18 22:27:43,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:43,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 150 states. [2018-11-18 22:27:43,102 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 150 states. [2018-11-18 22:27:43,102 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 150 states. [2018-11-18 22:27:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:43,108 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2018-11-18 22:27:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 218 transitions. [2018-11-18 22:27:43,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:43,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:43,109 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 192 states. [2018-11-18 22:27:43,109 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 192 states. [2018-11-18 22:27:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:43,113 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2018-11-18 22:27:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 218 transitions. [2018-11-18 22:27:43,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:43,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:43,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:43,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-18 22:27:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2018-11-18 22:27:43,117 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 22 [2018-11-18 22:27:43,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:43,118 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2018-11-18 22:27:43,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:27:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2018-11-18 22:27:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 22:27:43,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:43,119 INFO L375 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-18 22:27:43,119 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:43,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:43,120 INFO L82 PathProgramCache]: Analyzing trace with hash -715090112, now seen corresponding path program 1 times [2018-11-18 22:27:43,120 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:43,120 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:27:43,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:43,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:43,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {17018#true} call ULTIMATE.init(); {17018#true} is VALID [2018-11-18 22:27:43,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {17018#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {17018#true} is VALID [2018-11-18 22:27:43,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {17018#true} assume true; {17018#true} is VALID [2018-11-18 22:27:43,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17018#true} {17018#true} #388#return; {17018#true} is VALID [2018-11-18 22:27:43,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {17018#true} call #t~ret15 := main(); {17018#true} is VALID [2018-11-18 22:27:43,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {17018#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {17018#true} is VALID [2018-11-18 22:27:43,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {17018#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17041#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:43,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {17041#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {17045#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:43,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {17045#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {17045#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:43,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {17045#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {17052#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:27:43,386 INFO L273 TraceCheckUtils]: 10: Hoare triple {17052#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17056#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:43,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {17056#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:43,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:43,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:27:43,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:43,390 INFO L273 TraceCheckUtils]: 15: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:43,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:43,391 INFO L273 TraceCheckUtils]: 17: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:43,392 INFO L273 TraceCheckUtils]: 18: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:43,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:27:43,394 INFO L273 TraceCheckUtils]: 20: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {17089#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:43,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {17089#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {17019#false} is VALID [2018-11-18 22:27:43,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {17019#false} assume !false; {17019#false} is VALID [2018-11-18 22:27:43,397 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-18 22:27:43,398 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:43,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:43,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 22:27:43,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-18 22:27:43,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:43,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:27:43,432 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-18 22:27:43,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:27:43,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:27:43,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:27:43,433 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand 9 states. [2018-11-18 22:27:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:45,353 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2018-11-18 22:27:45,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:27:45,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-18 22:27:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:27:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2018-11-18 22:27:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:27:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2018-11-18 22:27:45,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 188 transitions. [2018-11-18 22:27:45,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:45,648 INFO L225 Difference]: With dead ends: 187 [2018-11-18 22:27:45,648 INFO L226 Difference]: Without dead ends: 185 [2018-11-18 22:27:45,648 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:27:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-18 22:27:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 148. [2018-11-18 22:27:45,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:45,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 148 states. [2018-11-18 22:27:45,666 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 148 states. [2018-11-18 22:27:45,666 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 148 states. [2018-11-18 22:27:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:45,670 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2018-11-18 22:27:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2018-11-18 22:27:45,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:45,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:45,670 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 185 states. [2018-11-18 22:27:45,671 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 185 states. [2018-11-18 22:27:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:45,674 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2018-11-18 22:27:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2018-11-18 22:27:45,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:45,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:45,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:45,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-18 22:27:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2018-11-18 22:27:45,678 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 23 [2018-11-18 22:27:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:45,679 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2018-11-18 22:27:45,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:27:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-11-18 22:27:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 22:27:45,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:45,679 INFO L375 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-18 22:27:45,680 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:45,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1709433728, now seen corresponding path program 1 times [2018-11-18 22:27:45,680 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:45,681 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:27:45,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:45,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:46,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {17831#true} call ULTIMATE.init(); {17831#true} is VALID [2018-11-18 22:27:46,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {17831#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {17831#true} is VALID [2018-11-18 22:27:46,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {17831#true} assume true; {17831#true} is VALID [2018-11-18 22:27:46,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17831#true} {17831#true} #388#return; {17831#true} is VALID [2018-11-18 22:27:46,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {17831#true} call #t~ret15 := main(); {17831#true} is VALID [2018-11-18 22:27:46,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {17831#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {17831#true} is VALID [2018-11-18 22:27:46,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {17831#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17854#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {17854#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {17854#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {17854#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {17854#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {17854#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {17854#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {17854#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {17867#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {17867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {17867#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {17867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {17867#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {17867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {17867#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17880#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {17880#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {17880#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {17880#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {17880#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {17880#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {17880#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,281 INFO L273 TraceCheckUtils]: 18: Hoare triple {17880#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17893#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {17893#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {17893#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:27:46,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {17893#(= (_ bv3 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {17900#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:46,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {17900#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {17832#false} is VALID [2018-11-18 22:27:46,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {17832#false} assume !false; {17832#false} is VALID [2018-11-18 22:27:46,284 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-18 22:27:46,284 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:46,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:46,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:27:46,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-18 22:27:46,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:46,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:27:46,314 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-18 22:27:46,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:27:46,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:27:46,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:27:46,315 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 7 states. [2018-11-18 22:27:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:48,341 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2018-11-18 22:27:48,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:27:48,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-18 22:27:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2018-11-18 22:27:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2018-11-18 22:27:48,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 214 transitions. [2018-11-18 22:27:49,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:49,131 INFO L225 Difference]: With dead ends: 198 [2018-11-18 22:27:49,131 INFO L226 Difference]: Without dead ends: 196 [2018-11-18 22:27:49,132 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:27:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-18 22:27:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 150. [2018-11-18 22:27:49,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:49,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 150 states. [2018-11-18 22:27:49,164 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 150 states. [2018-11-18 22:27:49,164 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 150 states. [2018-11-18 22:27:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:49,169 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2018-11-18 22:27:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2018-11-18 22:27:49,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:49,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:49,170 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 196 states. [2018-11-18 22:27:49,170 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 196 states. [2018-11-18 22:27:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:49,173 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2018-11-18 22:27:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2018-11-18 22:27:49,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:49,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:49,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:49,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-18 22:27:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2018-11-18 22:27:49,177 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 23 [2018-11-18 22:27:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:49,177 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2018-11-18 22:27:49,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:27:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2018-11-18 22:27:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 22:27:49,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:49,178 INFO L375 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-18 22:27:49,179 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:49,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:49,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1124307341, now seen corresponding path program 1 times [2018-11-18 22:27:49,179 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:49,179 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:27:49,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:49,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:49,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {18678#true} call ULTIMATE.init(); {18678#true} is VALID [2018-11-18 22:27:49,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {18678#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {18678#true} is VALID [2018-11-18 22:27:49,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {18678#true} assume true; {18678#true} is VALID [2018-11-18 22:27:49,347 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18678#true} {18678#true} #388#return; {18678#true} is VALID [2018-11-18 22:27:49,347 INFO L256 TraceCheckUtils]: 4: Hoare triple {18678#true} call #t~ret15 := main(); {18678#true} is VALID [2018-11-18 22:27:49,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {18678#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {18678#true} is VALID [2018-11-18 22:27:49,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {18678#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {18701#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {18701#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {18701#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {18701#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {18701#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {18701#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {18701#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {18701#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {18714#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {18714#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {18714#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {18714#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {18714#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {18714#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {18714#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {18714#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {18727#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {18727#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {18727#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {18727#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {18727#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {18727#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {18727#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {18727#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {18740#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {18740#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {18740#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:27:49,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {18740#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {18747#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:49,356 INFO L273 TraceCheckUtils]: 21: Hoare triple {18747#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {18679#false} is VALID [2018-11-18 22:27:49,356 INFO L273 TraceCheckUtils]: 22: Hoare triple {18679#false} assume !false; {18679#false} is VALID [2018-11-18 22:27:49,357 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-18 22:27:49,357 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:49,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:49,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:27:49,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-18 22:27:49,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:49,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:27:49,388 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-18 22:27:49,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:27:49,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:27:49,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:27:49,389 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand 7 states. [2018-11-18 22:27:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:51,915 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2018-11-18 22:27:51,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:27:51,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-18 22:27:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2018-11-18 22:27:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2018-11-18 22:27:51,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 212 transitions. [2018-11-18 22:27:52,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:52,183 INFO L225 Difference]: With dead ends: 196 [2018-11-18 22:27:52,183 INFO L226 Difference]: Without dead ends: 194 [2018-11-18 22:27:52,183 INFO L604 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-18 22:27:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-18 22:27:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 153. [2018-11-18 22:27:52,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:52,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 153 states. [2018-11-18 22:27:52,207 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 153 states. [2018-11-18 22:27:52,208 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 153 states. [2018-11-18 22:27:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:52,211 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2018-11-18 22:27:52,211 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2018-11-18 22:27:52,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:52,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:52,212 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 194 states. [2018-11-18 22:27:52,212 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 194 states. [2018-11-18 22:27:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:52,215 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2018-11-18 22:27:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2018-11-18 22:27:52,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:52,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:52,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:52,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-18 22:27:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2018-11-18 22:27:52,218 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 23 [2018-11-18 22:27:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:52,219 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2018-11-18 22:27:52,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:27:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2018-11-18 22:27:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 22:27:52,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:52,219 INFO L375 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-18 22:27:52,220 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:52,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:52,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2005126242, now seen corresponding path program 1 times [2018-11-18 22:27:52,220 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:52,220 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:27:52,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:52,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:52,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {19523#true} call ULTIMATE.init(); {19523#true} is VALID [2018-11-18 22:27:52,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {19523#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {19523#true} is VALID [2018-11-18 22:27:52,376 INFO L273 TraceCheckUtils]: 2: Hoare triple {19523#true} assume true; {19523#true} is VALID [2018-11-18 22:27:52,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19523#true} {19523#true} #388#return; {19523#true} is VALID [2018-11-18 22:27:52,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {19523#true} call #t~ret15 := main(); {19523#true} is VALID [2018-11-18 22:27:52,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {19523#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {19523#true} is VALID [2018-11-18 22:27:52,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {19523#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {19546#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,391 INFO L273 TraceCheckUtils]: 7: Hoare triple {19546#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {19546#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {19546#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {19546#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {19546#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {19546#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {19546#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19559#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {19559#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {19559#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {19559#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {19559#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {19559#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {19559#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {19559#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,395 INFO L273 TraceCheckUtils]: 17: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,396 INFO L273 TraceCheckUtils]: 19: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19591#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:27:52,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {19591#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {19595#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:52,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {19595#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {19524#false} is VALID [2018-11-18 22:27:52,399 INFO L273 TraceCheckUtils]: 23: Hoare triple {19524#false} assume !false; {19524#false} is VALID [2018-11-18 22:27:52,400 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-18 22:27:52,401 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:52,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:52,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:27:52,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-18 22:27:52,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:52,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:27:52,430 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-18 22:27:52,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:27:52,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:27:52,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:27:52,431 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand 7 states. [2018-11-18 22:27:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:54,444 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2018-11-18 22:27:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:27:54,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-18 22:27:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2018-11-18 22:27:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:27:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2018-11-18 22:27:54,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 210 transitions. [2018-11-18 22:27:54,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:54,715 INFO L225 Difference]: With dead ends: 194 [2018-11-18 22:27:54,715 INFO L226 Difference]: Without dead ends: 192 [2018-11-18 22:27:54,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 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-18 22:27:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-18 22:27:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2018-11-18 22:27:54,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:54,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 156 states. [2018-11-18 22:27:54,761 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 156 states. [2018-11-18 22:27:54,761 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 156 states. [2018-11-18 22:27:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:54,764 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-11-18 22:27:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 217 transitions. [2018-11-18 22:27:54,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:54,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:54,765 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 192 states. [2018-11-18 22:27:54,765 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 192 states. [2018-11-18 22:27:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:54,767 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-11-18 22:27:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 217 transitions. [2018-11-18 22:27:54,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:54,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:54,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:54,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-18 22:27:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 184 transitions. [2018-11-18 22:27:54,770 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 184 transitions. Word has length 24 [2018-11-18 22:27:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:54,770 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 184 transitions. [2018-11-18 22:27:54,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:27:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 184 transitions. [2018-11-18 22:27:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 22:27:54,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:54,771 INFO L375 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-18 22:27:54,771 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:54,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:54,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1452841077, now seen corresponding path program 1 times [2018-11-18 22:27:54,772 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:54,772 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:27:54,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:54,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:54,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {20368#true} call ULTIMATE.init(); {20368#true} is VALID [2018-11-18 22:27:54,978 INFO L273 TraceCheckUtils]: 1: Hoare triple {20368#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {20368#true} is VALID [2018-11-18 22:27:54,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {20368#true} assume true; {20368#true} is VALID [2018-11-18 22:27:54,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20368#true} {20368#true} #388#return; {20368#true} is VALID [2018-11-18 22:27:54,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {20368#true} call #t~ret15 := main(); {20368#true} is VALID [2018-11-18 22:27:54,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {20368#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {20368#true} is VALID [2018-11-18 22:27:54,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {20368#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {20391#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:54,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {20391#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {20391#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:54,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {20391#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {20391#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:54,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {20391#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {20391#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:54,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {20391#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20404#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:54,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {20404#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {20404#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:54,982 INFO L273 TraceCheckUtils]: 12: Hoare triple {20404#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {20404#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:54,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {20404#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {20404#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:54,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {20404#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20417#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:54,983 INFO L273 TraceCheckUtils]: 15: Hoare triple {20417#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {20417#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:54,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {20417#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {20417#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:54,984 INFO L273 TraceCheckUtils]: 17: Hoare triple {20417#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {20417#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:54,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {20417#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20430#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:27:54,985 INFO L273 TraceCheckUtils]: 19: Hoare triple {20430#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {20434#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-18 22:27:54,986 INFO L273 TraceCheckUtils]: 20: Hoare triple {20434#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20434#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-18 22:27:54,987 INFO L273 TraceCheckUtils]: 21: Hoare triple {20434#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {20441#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:54,988 INFO L273 TraceCheckUtils]: 22: Hoare triple {20441#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {20369#false} is VALID [2018-11-18 22:27:54,988 INFO L273 TraceCheckUtils]: 23: Hoare triple {20369#false} assume !false; {20369#false} is VALID [2018-11-18 22:27:54,989 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-18 22:27:54,989 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:54,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:54,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 22:27:54,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-18 22:27:54,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:54,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:27:55,019 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-18 22:27:55,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:27:55,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:27:55,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:27:55,020 INFO L87 Difference]: Start difference. First operand 156 states and 184 transitions. Second operand 8 states. [2018-11-18 22:27:57,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:57,590 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-11-18 22:27:57,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:27:57,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-18 22:27:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:27:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:27:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2018-11-18 22:27:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:27:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2018-11-18 22:27:57,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 208 transitions. [2018-11-18 22:27:57,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:27:57,826 INFO L225 Difference]: With dead ends: 192 [2018-11-18 22:27:57,826 INFO L226 Difference]: Without dead ends: 187 [2018-11-18 22:27:57,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:27:57,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-18 22:27:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 154. [2018-11-18 22:27:57,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:27:57,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 154 states. [2018-11-18 22:27:57,874 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 154 states. [2018-11-18 22:27:57,874 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 154 states. [2018-11-18 22:27:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:57,877 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-11-18 22:27:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 212 transitions. [2018-11-18 22:27:57,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:57,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:57,878 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 187 states. [2018-11-18 22:27:57,878 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 187 states. [2018-11-18 22:27:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:27:57,880 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-11-18 22:27:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 212 transitions. [2018-11-18 22:27:57,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:27:57,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:27:57,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:27:57,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:27:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-18 22:27:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2018-11-18 22:27:57,883 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 24 [2018-11-18 22:27:57,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:27:57,883 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2018-11-18 22:27:57,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:27:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2018-11-18 22:27:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 22:27:57,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:27:57,884 INFO L375 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-18 22:27:57,884 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:27:57,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:27:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash 493792295, now seen corresponding path program 1 times [2018-11-18 22:27:57,885 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:27:57,885 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:27:57,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:27:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:27:57,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:27:58,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {21199#true} call ULTIMATE.init(); {21199#true} is VALID [2018-11-18 22:27:58,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {21199#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {21199#true} is VALID [2018-11-18 22:27:58,060 INFO L273 TraceCheckUtils]: 2: Hoare triple {21199#true} assume true; {21199#true} is VALID [2018-11-18 22:27:58,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21199#true} {21199#true} #388#return; {21199#true} is VALID [2018-11-18 22:27:58,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {21199#true} call #t~ret15 := main(); {21199#true} is VALID [2018-11-18 22:27:58,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {21199#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {21199#true} is VALID [2018-11-18 22:27:58,061 INFO L273 TraceCheckUtils]: 6: Hoare triple {21199#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {21222#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {21222#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {21222#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {21222#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {21222#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {21222#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {21222#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {21222#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21235#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {21235#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {21235#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {21235#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {21235#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,064 INFO L273 TraceCheckUtils]: 13: Hoare triple {21235#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {21235#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {21235#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,065 INFO L273 TraceCheckUtils]: 15: Hoare triple {21248#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {21248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {21248#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {21248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,066 INFO L273 TraceCheckUtils]: 17: Hoare triple {21248#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {21248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {21248#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {21261#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,067 INFO L273 TraceCheckUtils]: 19: Hoare triple {21261#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {21261#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:27:58,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {21261#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {21268#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-18 22:27:58,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {21268#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {21272#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:27:58,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {21272#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {21200#false} is VALID [2018-11-18 22:27:58,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {21200#false} assume !false; {21200#false} is VALID [2018-11-18 22:27:58,070 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-18 22:27:58,071 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:27:58,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:27:58,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 22:27:58,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-18 22:27:58,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:27:58,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:27:58,102 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-18 22:27:58,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:27:58,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:27:58,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:27:58,103 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand 8 states. [2018-11-18 22:28:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:00,595 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-11-18 22:28:00,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:28:00,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-18 22:28:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:28:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:28:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2018-11-18 22:28:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:28:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2018-11-18 22:28:00,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 203 transitions. [2018-11-18 22:28:00,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:00,827 INFO L225 Difference]: With dead ends: 187 [2018-11-18 22:28:00,827 INFO L226 Difference]: Without dead ends: 183 [2018-11-18 22:28:00,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:28:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-18 22:28:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 153. [2018-11-18 22:28:00,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:28:00,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand 153 states. [2018-11-18 22:28:00,873 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 153 states. [2018-11-18 22:28:00,873 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 153 states. [2018-11-18 22:28:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:00,877 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2018-11-18 22:28:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-11-18 22:28:00,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:00,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:00,877 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 183 states. [2018-11-18 22:28:00,877 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 183 states. [2018-11-18 22:28:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:00,880 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2018-11-18 22:28:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-11-18 22:28:00,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:00,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:00,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:28:00,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:28:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-18 22:28:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2018-11-18 22:28:00,883 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 24 [2018-11-18 22:28:00,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:28:00,883 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2018-11-18 22:28:00,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:28:00,883 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2018-11-18 22:28:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 22:28:00,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:28:00,884 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:28:00,884 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:28:00,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:28:00,884 INFO L82 PathProgramCache]: Analyzing trace with hash -2028941227, now seen corresponding path program 1 times [2018-11-18 22:28:00,885 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:28:00,885 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:28:00,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:28:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:00,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:28:01,057 INFO L256 TraceCheckUtils]: 0: Hoare triple {22015#true} call ULTIMATE.init(); {22015#true} is VALID [2018-11-18 22:28:01,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {22015#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {22015#true} is VALID [2018-11-18 22:28:01,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-18 22:28:01,058 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22015#true} {22015#true} #388#return; {22015#true} is VALID [2018-11-18 22:28:01,058 INFO L256 TraceCheckUtils]: 4: Hoare triple {22015#true} call #t~ret15 := main(); {22015#true} is VALID [2018-11-18 22:28:01,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {22015#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {22015#true} is VALID [2018-11-18 22:28:01,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {22015#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {22038#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {22038#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {22038#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,059 INFO L273 TraceCheckUtils]: 8: Hoare triple {22038#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {22038#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {22038#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {22038#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {22038#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22051#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,060 INFO L273 TraceCheckUtils]: 11: Hoare triple {22051#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {22051#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {22051#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {22051#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {22051#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {22051#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,062 INFO L273 TraceCheckUtils]: 14: Hoare triple {22051#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,068 INFO L273 TraceCheckUtils]: 16: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,069 INFO L273 TraceCheckUtils]: 19: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22083#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {22083#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {22083#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:01,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {22083#(= (_ bv3 32) main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {22090#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:28:01,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {22090#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {22016#false} is VALID [2018-11-18 22:28:01,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {22016#false} assume !false; {22016#false} is VALID [2018-11-18 22:28:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:28:01,072 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:28:01,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:28:01,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:28:01,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-18 22:28:01,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:28:01,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:28:01,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:01,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:28:01,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:28:01,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:28:01,165 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand 7 states. [2018-11-18 22:28:03,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:03,602 INFO L93 Difference]: Finished difference Result 238 states and 267 transitions. [2018-11-18 22:28:03,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:28:03,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-18 22:28:03,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:28:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:28:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions. [2018-11-18 22:28:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:28:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions. [2018-11-18 22:28:03,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 267 transitions. [2018-11-18 22:28:03,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:03,916 INFO L225 Difference]: With dead ends: 238 [2018-11-18 22:28:03,916 INFO L226 Difference]: Without dead ends: 236 [2018-11-18 22:28:03,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:28:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-18 22:28:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 158. [2018-11-18 22:28:03,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:28:03,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand 158 states. [2018-11-18 22:28:03,944 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 158 states. [2018-11-18 22:28:03,944 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 158 states. [2018-11-18 22:28:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:03,948 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-11-18 22:28:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 265 transitions. [2018-11-18 22:28:03,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:03,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:03,949 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 236 states. [2018-11-18 22:28:03,949 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 236 states. [2018-11-18 22:28:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:03,953 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-11-18 22:28:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 265 transitions. [2018-11-18 22:28:03,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:03,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:03,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:28:03,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:28:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-18 22:28:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 187 transitions. [2018-11-18 22:28:03,957 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 187 transitions. Word has length 25 [2018-11-18 22:28:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:28:03,957 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 187 transitions. [2018-11-18 22:28:03,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:28:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 187 transitions. [2018-11-18 22:28:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 22:28:03,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:28:03,958 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:28:03,958 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:28:03,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:28:03,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2029368231, now seen corresponding path program 1 times [2018-11-18 22:28:03,959 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:28:03,959 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:28:04,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:28:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:04,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:28:04,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {23005#true} call ULTIMATE.init(); {23005#true} is VALID [2018-11-18 22:28:04,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {23005#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {23005#true} is VALID [2018-11-18 22:28:04,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {23005#true} assume true; {23005#true} is VALID [2018-11-18 22:28:04,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23005#true} {23005#true} #388#return; {23005#true} is VALID [2018-11-18 22:28:04,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {23005#true} call #t~ret15 := main(); {23005#true} is VALID [2018-11-18 22:28:04,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {23005#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {23005#true} is VALID [2018-11-18 22:28:04,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {23005#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {23028#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,200 INFO L273 TraceCheckUtils]: 7: Hoare triple {23028#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {23028#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,201 INFO L273 TraceCheckUtils]: 8: Hoare triple {23028#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {23028#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,201 INFO L273 TraceCheckUtils]: 9: Hoare triple {23028#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {23028#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,202 INFO L273 TraceCheckUtils]: 10: Hoare triple {23028#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23041#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,202 INFO L273 TraceCheckUtils]: 11: Hoare triple {23041#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {23041#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {23041#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {23041#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {23041#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {23041#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,203 INFO L273 TraceCheckUtils]: 14: Hoare triple {23041#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,204 INFO L273 TraceCheckUtils]: 15: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,204 INFO L273 TraceCheckUtils]: 16: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,205 INFO L273 TraceCheckUtils]: 17: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,206 INFO L273 TraceCheckUtils]: 19: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,208 INFO L273 TraceCheckUtils]: 20: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23073#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:04,208 INFO L273 TraceCheckUtils]: 21: Hoare triple {23073#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {23077#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-18 22:28:04,209 INFO L273 TraceCheckUtils]: 22: Hoare triple {23077#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {23081#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:28:04,210 INFO L273 TraceCheckUtils]: 23: Hoare triple {23081#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {23006#false} is VALID [2018-11-18 22:28:04,210 INFO L273 TraceCheckUtils]: 24: Hoare triple {23006#false} assume !false; {23006#false} is VALID [2018-11-18 22:28:04,211 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-18 22:28:04,211 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:28:04,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:28:04,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 22:28:04,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-18 22:28:04,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:28:04,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:28:04,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:04,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:28:04,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:28:04,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:28:04,249 INFO L87 Difference]: Start difference. First operand 158 states and 187 transitions. Second operand 8 states. [2018-11-18 22:28:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:06,416 INFO L93 Difference]: Finished difference Result 181 states and 206 transitions. [2018-11-18 22:28:06,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:28:06,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-18 22:28:06,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:28:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:28:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2018-11-18 22:28:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:28:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2018-11-18 22:28:06,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 197 transitions. [2018-11-18 22:28:06,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:06,643 INFO L225 Difference]: With dead ends: 181 [2018-11-18 22:28:06,644 INFO L226 Difference]: Without dead ends: 177 [2018-11-18 22:28:06,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:28:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-18 22:28:06,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 157. [2018-11-18 22:28:06,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:28:06,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 157 states. [2018-11-18 22:28:06,685 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 157 states. [2018-11-18 22:28:06,685 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 157 states. [2018-11-18 22:28:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:06,689 INFO L93 Difference]: Finished difference Result 177 states and 202 transitions. [2018-11-18 22:28:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 202 transitions. [2018-11-18 22:28:06,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:06,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:06,689 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 177 states. [2018-11-18 22:28:06,690 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 177 states. [2018-11-18 22:28:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:06,692 INFO L93 Difference]: Finished difference Result 177 states and 202 transitions. [2018-11-18 22:28:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 202 transitions. [2018-11-18 22:28:06,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:06,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:06,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:28:06,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:28:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 22:28:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 185 transitions. [2018-11-18 22:28:06,695 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 185 transitions. Word has length 25 [2018-11-18 22:28:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:28:06,695 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 185 transitions. [2018-11-18 22:28:06,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:28:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 185 transitions. [2018-11-18 22:28:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 22:28:06,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:28:06,695 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:28:06,696 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:28:06,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:28:06,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1859040002, now seen corresponding path program 1 times [2018-11-18 22:28:06,697 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:28:06,697 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:28:06,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:28:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:06,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:28:06,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {23811#true} call ULTIMATE.init(); {23811#true} is VALID [2018-11-18 22:28:06,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {23811#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {23811#true} is VALID [2018-11-18 22:28:06,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {23811#true} assume true; {23811#true} is VALID [2018-11-18 22:28:06,868 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23811#true} {23811#true} #388#return; {23811#true} is VALID [2018-11-18 22:28:06,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {23811#true} call #t~ret15 := main(); {23811#true} is VALID [2018-11-18 22:28:06,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {23811#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {23811#true} is VALID [2018-11-18 22:28:06,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {23811#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {23834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,870 INFO L273 TraceCheckUtils]: 7: Hoare triple {23834#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {23834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {23834#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {23834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {23834#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {23834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {23834#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {23847#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {23847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {23847#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {23847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {23847#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {23847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,873 INFO L273 TraceCheckUtils]: 14: Hoare triple {23847#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,873 INFO L273 TraceCheckUtils]: 15: Hoare triple {23860#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {23860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,874 INFO L273 TraceCheckUtils]: 16: Hoare triple {23860#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {23860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {23860#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {23860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,875 INFO L273 TraceCheckUtils]: 18: Hoare triple {23860#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {23873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,876 INFO L273 TraceCheckUtils]: 19: Hoare triple {23873#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {23873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {23873#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {23873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {23873#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {23873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:06,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {23873#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {23886#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:28:06,878 INFO L273 TraceCheckUtils]: 23: Hoare triple {23886#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {23812#false} is VALID [2018-11-18 22:28:06,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {23812#false} assume !false; {23812#false} is VALID [2018-11-18 22:28:06,879 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-18 22:28:06,879 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:28:06,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:28:06,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:28:06,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-18 22:28:06,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:28:06,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:28:06,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:06,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:28:06,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:28:06,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:28:06,913 INFO L87 Difference]: Start difference. First operand 157 states and 185 transitions. Second operand 7 states. [2018-11-18 22:28:09,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:09,115 INFO L93 Difference]: Finished difference Result 227 states and 256 transitions. [2018-11-18 22:28:09,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:28:09,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-18 22:28:09,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:28:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:28:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions. [2018-11-18 22:28:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:28:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions. [2018-11-18 22:28:09,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 247 transitions. [2018-11-18 22:28:09,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:09,402 INFO L225 Difference]: With dead ends: 227 [2018-11-18 22:28:09,403 INFO L226 Difference]: Without dead ends: 225 [2018-11-18 22:28:09,403 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:28:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-18 22:28:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 158. [2018-11-18 22:28:09,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:28:09,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand 158 states. [2018-11-18 22:28:09,462 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 158 states. [2018-11-18 22:28:09,462 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 158 states. [2018-11-18 22:28:09,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:09,466 INFO L93 Difference]: Finished difference Result 225 states and 254 transitions. [2018-11-18 22:28:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 254 transitions. [2018-11-18 22:28:09,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:09,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:09,467 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 225 states. [2018-11-18 22:28:09,467 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 225 states. [2018-11-18 22:28:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:09,471 INFO L93 Difference]: Finished difference Result 225 states and 254 transitions. [2018-11-18 22:28:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 254 transitions. [2018-11-18 22:28:09,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:09,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:09,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:28:09,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:28:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-18 22:28:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-11-18 22:28:09,475 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 25 [2018-11-18 22:28:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:28:09,475 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-11-18 22:28:09,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:28:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-11-18 22:28:09,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 22:28:09,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:28:09,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:28:09,476 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:28:09,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:28:09,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1857500802, now seen corresponding path program 1 times [2018-11-18 22:28:09,477 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:28:09,477 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:28:09,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:28:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:09,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:28:09,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {24768#true} call ULTIMATE.init(); {24768#true} is VALID [2018-11-18 22:28:09,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {24768#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {24768#true} is VALID [2018-11-18 22:28:09,680 INFO L273 TraceCheckUtils]: 2: Hoare triple {24768#true} assume true; {24768#true} is VALID [2018-11-18 22:28:09,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24768#true} {24768#true} #388#return; {24768#true} is VALID [2018-11-18 22:28:09,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {24768#true} call #t~ret15 := main(); {24768#true} is VALID [2018-11-18 22:28:09,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {24768#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {24768#true} is VALID [2018-11-18 22:28:09,698 INFO L273 TraceCheckUtils]: 6: Hoare triple {24768#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {24791#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,705 INFO L273 TraceCheckUtils]: 7: Hoare triple {24791#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {24791#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {24791#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {24791#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {24791#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {24791#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {24791#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24804#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,706 INFO L273 TraceCheckUtils]: 11: Hoare triple {24804#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {24804#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {24804#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {24804#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,707 INFO L273 TraceCheckUtils]: 13: Hoare triple {24804#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {24804#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,708 INFO L273 TraceCheckUtils]: 14: Hoare triple {24804#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24817#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {24817#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {24817#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {24817#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {24817#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {24817#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {24817#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,709 INFO L273 TraceCheckUtils]: 18: Hoare triple {24817#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {24830#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {24830#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {24830#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,710 INFO L273 TraceCheckUtils]: 20: Hoare triple {24830#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {24830#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,710 INFO L273 TraceCheckUtils]: 21: Hoare triple {24830#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {24830#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:09,711 INFO L273 TraceCheckUtils]: 22: Hoare triple {24830#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {24843#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:28:09,712 INFO L273 TraceCheckUtils]: 23: Hoare triple {24843#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~12; {24769#false} is VALID [2018-11-18 22:28:09,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {24769#false} assume !false; {24769#false} is VALID [2018-11-18 22:28:09,713 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-18 22:28:09,713 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:28:09,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:28:09,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:28:09,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-18 22:28:09,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:28:09,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:28:09,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:09,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:28:09,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:28:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:28:09,748 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 7 states. [2018-11-18 22:28:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:11,821 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2018-11-18 22:28:11,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:28:11,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-18 22:28:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:28:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:28:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2018-11-18 22:28:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:28:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2018-11-18 22:28:11,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 191 transitions. [2018-11-18 22:28:12,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:12,039 INFO L225 Difference]: With dead ends: 175 [2018-11-18 22:28:12,040 INFO L226 Difference]: Without dead ends: 173 [2018-11-18 22:28:12,040 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:28:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-18 22:28:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2018-11-18 22:28:12,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:28:12,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 158 states. [2018-11-18 22:28:12,062 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 158 states. [2018-11-18 22:28:12,062 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 158 states. [2018-11-18 22:28:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:12,065 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2018-11-18 22:28:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2018-11-18 22:28:12,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:12,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:12,066 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 173 states. [2018-11-18 22:28:12,066 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 173 states. [2018-11-18 22:28:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:12,069 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2018-11-18 22:28:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2018-11-18 22:28:12,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:12,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:12,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:28:12,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:28:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-18 22:28:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-11-18 22:28:12,072 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 25 [2018-11-18 22:28:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:28:12,072 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-11-18 22:28:12,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:28:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-11-18 22:28:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 22:28:12,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:28:12,073 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:28:12,073 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:28:12,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:28:12,073 INFO L82 PathProgramCache]: Analyzing trace with hash -920208099, now seen corresponding path program 1 times [2018-11-18 22:28:12,073 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:28:12,073 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:28:12,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:28:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:12,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:28:12,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {25562#true} call ULTIMATE.init(); {25562#true} is VALID [2018-11-18 22:28:12,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {25562#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {25562#true} is VALID [2018-11-18 22:28:12,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {25562#true} assume true; {25562#true} is VALID [2018-11-18 22:28:12,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25562#true} {25562#true} #388#return; {25562#true} is VALID [2018-11-18 22:28:12,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {25562#true} call #t~ret15 := main(); {25562#true} is VALID [2018-11-18 22:28:12,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {25562#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {25562#true} is VALID [2018-11-18 22:28:12,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {25562#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {25585#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:12,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {25585#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {25589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:28:12,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {25589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {25589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:28:12,410 INFO L273 TraceCheckUtils]: 9: Hoare triple {25589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {25596#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-18 22:28:12,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {25596#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {25600#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:12,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {25600#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {25600#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:12,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {25600#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:12,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:12,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:12,415 INFO L273 TraceCheckUtils]: 15: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:12,416 INFO L273 TraceCheckUtils]: 16: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:12,417 INFO L273 TraceCheckUtils]: 17: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~11);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:12,418 INFO L273 TraceCheckUtils]: 18: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:12,419 INFO L273 TraceCheckUtils]: 19: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:12,420 INFO L273 TraceCheckUtils]: 20: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:12,421 INFO L273 TraceCheckUtils]: 21: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:12,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {25639#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:28:12,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {25639#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {25563#false} is VALID [2018-11-18 22:28:12,424 INFO L273 TraceCheckUtils]: 24: Hoare triple {25563#false} assume !false; {25563#false} is VALID [2018-11-18 22:28:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:28:12,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:28:13,063 INFO L273 TraceCheckUtils]: 24: Hoare triple {25563#false} assume !false; {25563#false} is VALID [2018-11-18 22:28:13,072 INFO L273 TraceCheckUtils]: 23: Hoare triple {25649#(not (= main_~__VERIFIER_assert__cond~7 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {25563#false} is VALID [2018-11-18 22:28:13,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {25649#(not (= main_~__VERIFIER_assert__cond~7 (_ bv0 32)))} is VALID [2018-11-18 22:28:13,095 INFO L273 TraceCheckUtils]: 21: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:13,107 INFO L273 TraceCheckUtils]: 20: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:13,125 INFO L273 TraceCheckUtils]: 19: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:13,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:13,151 INFO L273 TraceCheckUtils]: 17: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~11);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:13,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:13,173 INFO L273 TraceCheckUtils]: 15: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:13,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:13,199 INFO L273 TraceCheckUtils]: 13: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:13,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {25685#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:13,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {25685#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {25685#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:28:13,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {25692#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {25685#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:28:13,269 INFO L273 TraceCheckUtils]: 9: Hoare triple {25696#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {25692#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} is VALID [2018-11-18 22:28:13,278 INFO L273 TraceCheckUtils]: 8: Hoare triple {25696#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {25696#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:13,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {25562#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {25696#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:13,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {25562#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {25562#true} is VALID [2018-11-18 22:28:13,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {25562#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {25562#true} is VALID [2018-11-18 22:28:13,310 INFO L256 TraceCheckUtils]: 4: Hoare triple {25562#true} call #t~ret15 := main(); {25562#true} is VALID [2018-11-18 22:28:13,310 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25562#true} {25562#true} #388#return; {25562#true} is VALID [2018-11-18 22:28:13,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {25562#true} assume true; {25562#true} is VALID [2018-11-18 22:28:13,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {25562#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {25562#true} is VALID [2018-11-18 22:28:13,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {25562#true} call ULTIMATE.init(); {25562#true} is VALID [2018-11-18 22:28:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:28:13,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:28:13,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-18 22:28:13,313 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-11-18 22:28:13,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:28:13,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:28:13,446 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-18 22:28:13,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:28:13,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:28:13,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:28:13,447 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 15 states. [2018-11-18 22:28:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:22,526 INFO L93 Difference]: Finished difference Result 201 states and 233 transitions. [2018-11-18 22:28:22,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:28:22,526 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-11-18 22:28:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:28:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:28:22,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 199 transitions. [2018-11-18 22:28:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:28:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 199 transitions. [2018-11-18 22:28:22,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 199 transitions. [2018-11-18 22:28:23,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:23,011 INFO L225 Difference]: With dead ends: 201 [2018-11-18 22:28:23,011 INFO L226 Difference]: Without dead ends: 199 [2018-11-18 22:28:23,011 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:28:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-18 22:28:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 153. [2018-11-18 22:28:23,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:28:23,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 153 states. [2018-11-18 22:28:23,155 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 153 states. [2018-11-18 22:28:23,155 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 153 states. [2018-11-18 22:28:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:23,159 INFO L93 Difference]: Finished difference Result 199 states and 230 transitions. [2018-11-18 22:28:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2018-11-18 22:28:23,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:23,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:23,159 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 199 states. [2018-11-18 22:28:23,159 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 199 states. [2018-11-18 22:28:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:23,162 INFO L93 Difference]: Finished difference Result 199 states and 230 transitions. [2018-11-18 22:28:23,162 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2018-11-18 22:28:23,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:23,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:23,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:28:23,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:28:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-18 22:28:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2018-11-18 22:28:23,165 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 25 [2018-11-18 22:28:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:28:23,165 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2018-11-18 22:28:23,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:28:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2018-11-18 22:28:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 22:28:23,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:28:23,166 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:28:23,166 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:28:23,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:28:23,167 INFO L82 PathProgramCache]: Analyzing trace with hash -872492849, now seen corresponding path program 1 times [2018-11-18 22:28:23,167 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:28:23,167 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:28:23,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:28:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:23,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:28:23,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {26533#true} call ULTIMATE.init(); {26533#true} is VALID [2018-11-18 22:28:23,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {26533#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {26533#true} is VALID [2018-11-18 22:28:23,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {26533#true} assume true; {26533#true} is VALID [2018-11-18 22:28:23,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26533#true} {26533#true} #388#return; {26533#true} is VALID [2018-11-18 22:28:23,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {26533#true} call #t~ret15 := main(); {26533#true} is VALID [2018-11-18 22:28:23,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {26533#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {26533#true} is VALID [2018-11-18 22:28:23,496 INFO L273 TraceCheckUtils]: 6: Hoare triple {26533#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {26556#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:23,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {26556#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {26560#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:28:23,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {26560#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {26560#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-18 22:28:23,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {26560#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {26567#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-18 22:28:23,500 INFO L273 TraceCheckUtils]: 10: Hoare triple {26567#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {26571#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:23,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {26571#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {26571#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:23,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {26571#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:23,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:23,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:23,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:23,504 INFO L273 TraceCheckUtils]: 16: Hoare triple {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:23,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {26578#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~11);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:23,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:23,507 INFO L273 TraceCheckUtils]: 19: Hoare triple {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:23,508 INFO L273 TraceCheckUtils]: 20: Hoare triple {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:23,508 INFO L273 TraceCheckUtils]: 21: Hoare triple {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:23,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {26594#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {26610#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:28:23,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {26610#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~13; {26534#false} is VALID [2018-11-18 22:28:23,511 INFO L273 TraceCheckUtils]: 24: Hoare triple {26534#false} assume !false; {26534#false} is VALID [2018-11-18 22:28:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:28:23,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:28:24,105 INFO L273 TraceCheckUtils]: 24: Hoare triple {26534#false} assume !false; {26534#false} is VALID [2018-11-18 22:28:24,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {26620#(not (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~13; {26534#false} is VALID [2018-11-18 22:28:24,106 INFO L273 TraceCheckUtils]: 22: Hoare triple {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {26620#(not (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))} is VALID [2018-11-18 22:28:24,107 INFO L273 TraceCheckUtils]: 21: Hoare triple {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:24,107 INFO L273 TraceCheckUtils]: 20: Hoare triple {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:24,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:24,108 INFO L273 TraceCheckUtils]: 18: Hoare triple {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:24,121 INFO L273 TraceCheckUtils]: 17: Hoare triple {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~11);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {26624#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:24,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:24,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:24,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:24,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:24,123 INFO L273 TraceCheckUtils]: 12: Hoare triple {26656#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {26640#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:28:24,123 INFO L273 TraceCheckUtils]: 11: Hoare triple {26656#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {26656#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:28:24,148 INFO L273 TraceCheckUtils]: 10: Hoare triple {26663#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {26656#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:28:24,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {26667#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {26663#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} is VALID [2018-11-18 22:28:24,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {26667#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {26667#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:24,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {26533#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {26667#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:24,180 INFO L273 TraceCheckUtils]: 6: Hoare triple {26533#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {26533#true} is VALID [2018-11-18 22:28:24,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {26533#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {26533#true} is VALID [2018-11-18 22:28:24,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {26533#true} call #t~ret15 := main(); {26533#true} is VALID [2018-11-18 22:28:24,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26533#true} {26533#true} #388#return; {26533#true} is VALID [2018-11-18 22:28:24,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {26533#true} assume true; {26533#true} is VALID [2018-11-18 22:28:24,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {26533#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {26533#true} is VALID [2018-11-18 22:28:24,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {26533#true} call ULTIMATE.init(); {26533#true} is VALID [2018-11-18 22:28:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:28:24,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:28:24,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-18 22:28:24,185 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-11-18 22:28:24,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:28:24,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:28:24,363 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-18 22:28:24,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:28:24,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:28:24,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:28:24,364 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand 15 states. [2018-11-18 22:28:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:35,484 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2018-11-18 22:28:35,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:28:35,484 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-11-18 22:28:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:28:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:28:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 163 transitions. [2018-11-18 22:28:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:28:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 163 transitions. [2018-11-18 22:28:35,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 163 transitions. [2018-11-18 22:28:35,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:35,968 INFO L225 Difference]: With dead ends: 155 [2018-11-18 22:28:35,969 INFO L226 Difference]: Without dead ends: 149 [2018-11-18 22:28:35,969 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:28:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-18 22:28:36,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2018-11-18 22:28:36,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:28:36,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 145 states. [2018-11-18 22:28:36,097 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 145 states. [2018-11-18 22:28:36,097 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 145 states. [2018-11-18 22:28:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:36,100 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2018-11-18 22:28:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2018-11-18 22:28:36,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:36,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:36,100 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 149 states. [2018-11-18 22:28:36,101 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 149 states. [2018-11-18 22:28:36,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:36,103 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2018-11-18 22:28:36,103 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2018-11-18 22:28:36,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:36,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:36,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:28:36,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:28:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 22:28:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2018-11-18 22:28:36,105 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 25 [2018-11-18 22:28:36,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:28:36,105 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2018-11-18 22:28:36,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:28:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2018-11-18 22:28:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 22:28:36,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:28:36,106 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:28:36,107 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:28:36,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:28:36,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1527334546, now seen corresponding path program 1 times [2018-11-18 22:28:36,107 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:28:36,107 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:28:36,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:28:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:36,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:28:36,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {27338#true} call ULTIMATE.init(); {27338#true} is VALID [2018-11-18 22:28:36,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {27338#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {27338#true} is VALID [2018-11-18 22:28:36,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {27338#true} assume true; {27338#true} is VALID [2018-11-18 22:28:36,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27338#true} {27338#true} #388#return; {27338#true} is VALID [2018-11-18 22:28:36,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {27338#true} call #t~ret15 := main(); {27338#true} is VALID [2018-11-18 22:28:36,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {27338#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {27338#true} is VALID [2018-11-18 22:28:36,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {27338#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {27361#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:36,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {27361#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {27361#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:36,508 INFO L273 TraceCheckUtils]: 8: Hoare triple {27361#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {27361#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:36,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {27361#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {27371#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2018-11-18 22:28:36,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {27371#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:36,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:36,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:36,511 INFO L273 TraceCheckUtils]: 13: Hoare triple {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:36,512 INFO L273 TraceCheckUtils]: 14: Hoare triple {27375#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {27388#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:36,513 INFO L273 TraceCheckUtils]: 15: Hoare triple {27388#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {27388#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:36,514 INFO L273 TraceCheckUtils]: 16: Hoare triple {27388#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {27395#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:36,515 INFO L273 TraceCheckUtils]: 17: Hoare triple {27395#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {27395#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:36,515 INFO L273 TraceCheckUtils]: 18: Hoare triple {27395#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {27395#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:36,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {27395#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {27405#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~7 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2018-11-18 22:28:36,521 INFO L273 TraceCheckUtils]: 20: Hoare triple {27405#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~7 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27409#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:28:36,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {27409#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {27413#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:28:36,548 INFO L273 TraceCheckUtils]: 22: Hoare triple {27413#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {27413#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:28:36,558 INFO L273 TraceCheckUtils]: 23: Hoare triple {27413#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {27420#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:28:36,559 INFO L273 TraceCheckUtils]: 24: Hoare triple {27420#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {27339#false} is VALID [2018-11-18 22:28:36,559 INFO L273 TraceCheckUtils]: 25: Hoare triple {27339#false} assume !false; {27339#false} is VALID [2018-11-18 22:28:36,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-18 22:28:36,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:28:36,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:28:36,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 22:28:36,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-18 22:28:36,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:28:36,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:28:36,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:36,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:28:36,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:28:36,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:28:36,601 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 11 states. [2018-11-18 22:28:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:39,696 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2018-11-18 22:28:39,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:28:39,697 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-18 22:28:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:28:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:28:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2018-11-18 22:28:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:28:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2018-11-18 22:28:39,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 181 transitions. [2018-11-18 22:28:39,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:39,909 INFO L225 Difference]: With dead ends: 190 [2018-11-18 22:28:39,909 INFO L226 Difference]: Without dead ends: 188 [2018-11-18 22:28:39,909 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:28:39,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-18 22:28:39,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 155. [2018-11-18 22:28:39,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:28:39,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 155 states. [2018-11-18 22:28:39,959 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 155 states. [2018-11-18 22:28:39,959 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 155 states. [2018-11-18 22:28:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:39,962 INFO L93 Difference]: Finished difference Result 188 states and 215 transitions. [2018-11-18 22:28:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-11-18 22:28:39,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:39,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:39,962 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 188 states. [2018-11-18 22:28:39,962 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 188 states. [2018-11-18 22:28:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:39,965 INFO L93 Difference]: Finished difference Result 188 states and 215 transitions. [2018-11-18 22:28:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-11-18 22:28:39,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:39,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:39,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:28:39,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:28:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-18 22:28:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 180 transitions. [2018-11-18 22:28:39,967 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 180 transitions. Word has length 26 [2018-11-18 22:28:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:28:39,967 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 180 transitions. [2018-11-18 22:28:39,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:28:39,968 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 180 transitions. [2018-11-18 22:28:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 22:28:39,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:28:39,968 INFO L375 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-18 22:28:39,968 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:28:39,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:28:39,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1221230889, now seen corresponding path program 1 times [2018-11-18 22:28:39,969 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:28:39,969 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:28:39,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:28:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:40,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:28:40,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {28184#true} call ULTIMATE.init(); {28184#true} is VALID [2018-11-18 22:28:40,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {28184#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {28184#true} is VALID [2018-11-18 22:28:40,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {28184#true} assume true; {28184#true} is VALID [2018-11-18 22:28:40,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28184#true} {28184#true} #388#return; {28184#true} is VALID [2018-11-18 22:28:40,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {28184#true} call #t~ret15 := main(); {28184#true} is VALID [2018-11-18 22:28:40,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {28184#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {28184#true} is VALID [2018-11-18 22:28:40,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {28184#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {28207#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {28207#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {28207#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {28207#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {28207#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {28207#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {28207#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,278 INFO L273 TraceCheckUtils]: 10: Hoare triple {28207#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28220#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {28220#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {28220#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {28220#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {28220#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {28220#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {28220#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,279 INFO L273 TraceCheckUtils]: 14: Hoare triple {28220#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28233#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,280 INFO L273 TraceCheckUtils]: 15: Hoare triple {28233#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {28233#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,280 INFO L273 TraceCheckUtils]: 16: Hoare triple {28233#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {28233#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,281 INFO L273 TraceCheckUtils]: 17: Hoare triple {28233#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {28233#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,281 INFO L273 TraceCheckUtils]: 18: Hoare triple {28233#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28246#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,282 INFO L273 TraceCheckUtils]: 19: Hoare triple {28246#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {28246#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {28246#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {28246#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {28246#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {28246#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {28246#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28259#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {28259#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {28259#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:28:40,285 INFO L273 TraceCheckUtils]: 24: Hoare triple {28259#(= (_ bv4 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {28266#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:28:40,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {28266#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {28185#false} is VALID [2018-11-18 22:28:40,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {28185#false} assume !false; {28185#false} is VALID [2018-11-18 22:28:40,287 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-18 22:28:40,287 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:28:40,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:28:40,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 22:28:40,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-18 22:28:40,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:28:40,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:28:40,324 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-18 22:28:40,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:28:40,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:28:40,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:28:40,325 INFO L87 Difference]: Start difference. First operand 155 states and 180 transitions. Second operand 8 states. [2018-11-18 22:28:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:42,963 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2018-11-18 22:28:42,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:28:42,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-18 22:28:42,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:28:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:28:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2018-11-18 22:28:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:28:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2018-11-18 22:28:42,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 212 transitions. [2018-11-18 22:28:43,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:43,211 INFO L225 Difference]: With dead ends: 198 [2018-11-18 22:28:43,212 INFO L226 Difference]: Without dead ends: 196 [2018-11-18 22:28:43,212 INFO L604 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-18 22:28:43,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-18 22:28:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2018-11-18 22:28:43,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:28:43,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 157 states. [2018-11-18 22:28:43,444 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 157 states. [2018-11-18 22:28:43,444 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 157 states. [2018-11-18 22:28:43,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:43,448 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2018-11-18 22:28:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 222 transitions. [2018-11-18 22:28:43,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:43,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:43,448 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 196 states. [2018-11-18 22:28:43,449 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 196 states. [2018-11-18 22:28:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:43,451 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2018-11-18 22:28:43,451 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 222 transitions. [2018-11-18 22:28:43,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:43,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:43,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:28:43,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:28:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 22:28:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2018-11-18 22:28:43,454 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 27 [2018-11-18 22:28:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:28:43,454 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2018-11-18 22:28:43,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:28:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2018-11-18 22:28:43,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 22:28:43,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:28:43,455 INFO L375 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-18 22:28:43,455 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:28:43,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:28:43,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1807131842, now seen corresponding path program 1 times [2018-11-18 22:28:43,455 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:28:43,456 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:28:43,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:28:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:43,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:28:43,626 INFO L256 TraceCheckUtils]: 0: Hoare triple {29057#true} call ULTIMATE.init(); {29057#true} is VALID [2018-11-18 22:28:43,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {29057#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {29057#true} is VALID [2018-11-18 22:28:43,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {29057#true} assume true; {29057#true} is VALID [2018-11-18 22:28:43,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29057#true} {29057#true} #388#return; {29057#true} is VALID [2018-11-18 22:28:43,627 INFO L256 TraceCheckUtils]: 4: Hoare triple {29057#true} call #t~ret15 := main(); {29057#true} is VALID [2018-11-18 22:28:43,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {29057#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {29057#true} is VALID [2018-11-18 22:28:43,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {29057#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {29080#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,628 INFO L273 TraceCheckUtils]: 7: Hoare triple {29080#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {29080#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {29080#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {29080#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,629 INFO L273 TraceCheckUtils]: 9: Hoare triple {29080#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {29080#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,629 INFO L273 TraceCheckUtils]: 10: Hoare triple {29080#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29093#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {29093#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {29093#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,630 INFO L273 TraceCheckUtils]: 12: Hoare triple {29093#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {29093#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {29093#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {29093#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,631 INFO L273 TraceCheckUtils]: 14: Hoare triple {29093#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29106#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {29106#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {29106#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,632 INFO L273 TraceCheckUtils]: 16: Hoare triple {29106#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {29106#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {29106#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {29106#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {29106#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29119#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {29119#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {29119#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {29119#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {29119#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,635 INFO L273 TraceCheckUtils]: 21: Hoare triple {29119#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {29119#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {29119#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {29132#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,636 INFO L273 TraceCheckUtils]: 23: Hoare triple {29132#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {29132#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:28:43,637 INFO L273 TraceCheckUtils]: 24: Hoare triple {29132#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {29139#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:28:43,637 INFO L273 TraceCheckUtils]: 25: Hoare triple {29139#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {29058#false} is VALID [2018-11-18 22:28:43,637 INFO L273 TraceCheckUtils]: 26: Hoare triple {29058#false} assume !false; {29058#false} is VALID [2018-11-18 22:28:43,638 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-18 22:28:43,639 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:28:43,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:28:43,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 22:28:43,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-18 22:28:43,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:28:43,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:28:43,673 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-18 22:28:43,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:28:43,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:28:43,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:28:43,674 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 8 states. [2018-11-18 22:28:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:46,295 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2018-11-18 22:28:46,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:28:46,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-18 22:28:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:28:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:28:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2018-11-18 22:28:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:28:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2018-11-18 22:28:46,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 210 transitions. [2018-11-18 22:28:46,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:46,557 INFO L225 Difference]: With dead ends: 196 [2018-11-18 22:28:46,557 INFO L226 Difference]: Without dead ends: 194 [2018-11-18 22:28:46,557 INFO L604 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-18 22:28:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-18 22:28:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 161. [2018-11-18 22:28:46,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:28:46,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 161 states. [2018-11-18 22:28:46,734 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 161 states. [2018-11-18 22:28:46,734 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 161 states. [2018-11-18 22:28:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:46,738 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2018-11-18 22:28:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-11-18 22:28:46,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:46,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:46,738 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 194 states. [2018-11-18 22:28:46,738 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 194 states. [2018-11-18 22:28:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:46,741 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2018-11-18 22:28:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-11-18 22:28:46,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:46,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:46,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:28:46,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:28:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-18 22:28:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2018-11-18 22:28:46,744 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 27 [2018-11-18 22:28:46,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:28:46,745 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2018-11-18 22:28:46,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:28:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2018-11-18 22:28:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 22:28:46,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:28:46,745 INFO L375 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-18 22:28:46,746 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:28:46,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:28:46,746 INFO L82 PathProgramCache]: Analyzing trace with hash 211380849, now seen corresponding path program 1 times [2018-11-18 22:28:46,746 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:28:46,746 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:28:46,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:28:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:46,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:28:47,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {29929#true} call ULTIMATE.init(); {29929#true} is VALID [2018-11-18 22:28:47,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {29929#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {29929#true} is VALID [2018-11-18 22:28:47,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {29929#true} assume true; {29929#true} is VALID [2018-11-18 22:28:47,141 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29929#true} {29929#true} #388#return; {29929#true} is VALID [2018-11-18 22:28:47,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {29929#true} call #t~ret15 := main(); {29929#true} is VALID [2018-11-18 22:28:47,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {29929#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {29929#true} is VALID [2018-11-18 22:28:47,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {29929#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {29952#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:47,146 INFO L273 TraceCheckUtils]: 7: Hoare triple {29952#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {29952#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:47,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {29952#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {29952#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:47,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {29952#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {29962#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2018-11-18 22:28:47,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {29962#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:47,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:47,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:47,153 INFO L273 TraceCheckUtils]: 13: Hoare triple {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:28:47,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {29966#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29979#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:47,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {29979#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {29983#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:47,157 INFO L273 TraceCheckUtils]: 16: Hoare triple {29983#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {29983#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:28:47,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {29983#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {29990#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~21 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~21 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2018-11-18 22:28:47,161 INFO L273 TraceCheckUtils]: 18: Hoare triple {29990#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~21 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~21 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {29994#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:28:47,161 INFO L273 TraceCheckUtils]: 19: Hoare triple {29994#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {29994#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:28:47,162 INFO L273 TraceCheckUtils]: 20: Hoare triple {29994#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:28:47,163 INFO L273 TraceCheckUtils]: 21: Hoare triple {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:28:47,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:28:47,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:28:47,167 INFO L273 TraceCheckUtils]: 24: Hoare triple {30001#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {30014#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:28:47,168 INFO L273 TraceCheckUtils]: 25: Hoare triple {30014#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {29930#false} is VALID [2018-11-18 22:28:47,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {29930#false} assume !false; {29930#false} is VALID [2018-11-18 22:28:47,170 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-18 22:28:47,170 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:28:47,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:28:47,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 22:28:47,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-18 22:28:47,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:28:47,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:28:47,215 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-18 22:28:47,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:28:47,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:28:47,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:28:47,216 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand 11 states. [2018-11-18 22:28:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:51,002 INFO L93 Difference]: Finished difference Result 204 states and 235 transitions. [2018-11-18 22:28:51,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:28:51,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-18 22:28:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:28:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:28:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2018-11-18 22:28:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:28:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2018-11-18 22:28:51,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 187 transitions. [2018-11-18 22:28:51,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:51,306 INFO L225 Difference]: With dead ends: 204 [2018-11-18 22:28:51,306 INFO L226 Difference]: Without dead ends: 202 [2018-11-18 22:28:51,307 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:28:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-18 22:28:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 166. [2018-11-18 22:28:51,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:28:51,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 166 states. [2018-11-18 22:28:51,366 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 166 states. [2018-11-18 22:28:51,366 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 166 states. [2018-11-18 22:28:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:51,370 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2018-11-18 22:28:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 233 transitions. [2018-11-18 22:28:51,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:51,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:51,370 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 202 states. [2018-11-18 22:28:51,370 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 202 states. [2018-11-18 22:28:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:51,373 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2018-11-18 22:28:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 233 transitions. [2018-11-18 22:28:51,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:51,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:51,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:28:51,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:28:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-18 22:28:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 195 transitions. [2018-11-18 22:28:51,376 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 195 transitions. Word has length 27 [2018-11-18 22:28:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:28:51,376 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 195 transitions. [2018-11-18 22:28:51,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:28:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 195 transitions. [2018-11-18 22:28:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 22:28:51,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:28:51,377 INFO L375 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-18 22:28:51,377 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:28:51,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:28:51,377 INFO L82 PathProgramCache]: Analyzing trace with hash 796551166, now seen corresponding path program 1 times [2018-11-18 22:28:51,377 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:28:51,377 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:28:51,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:28:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:51,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:28:51,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {30838#true} call ULTIMATE.init(); {30838#true} is VALID [2018-11-18 22:28:51,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {30838#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {30838#true} is VALID [2018-11-18 22:28:51,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {30838#true} assume true; {30838#true} is VALID [2018-11-18 22:28:51,554 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30838#true} {30838#true} #388#return; {30838#true} is VALID [2018-11-18 22:28:51,554 INFO L256 TraceCheckUtils]: 4: Hoare triple {30838#true} call #t~ret15 := main(); {30838#true} is VALID [2018-11-18 22:28:51,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {30838#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {30838#true} is VALID [2018-11-18 22:28:51,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {30838#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {30861#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {30861#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {30861#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {30861#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {30861#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {30861#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {30861#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {30861#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30874#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {30874#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {30874#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {30874#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {30874#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {30874#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {30874#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {30874#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30887#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,559 INFO L273 TraceCheckUtils]: 15: Hoare triple {30887#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {30887#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {30887#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {30887#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {30887#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {30887#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {30887#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30900#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {30900#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {30900#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {30900#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {30900#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,562 INFO L273 TraceCheckUtils]: 21: Hoare triple {30900#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {30900#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,563 INFO L273 TraceCheckUtils]: 22: Hoare triple {30900#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {30913#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:28:51,564 INFO L273 TraceCheckUtils]: 23: Hoare triple {30913#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {30917#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:28:51,565 INFO L273 TraceCheckUtils]: 24: Hoare triple {30917#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {30917#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:28:51,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {30917#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {30924#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:28:51,566 INFO L273 TraceCheckUtils]: 26: Hoare triple {30924#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {30839#false} is VALID [2018-11-18 22:28:51,567 INFO L273 TraceCheckUtils]: 27: Hoare triple {30839#false} assume !false; {30839#false} is VALID [2018-11-18 22:28:51,568 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-18 22:28:51,568 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:28:51,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:28:51,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 22:28:51,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-18 22:28:51,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:28:51,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:28:51,608 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-18 22:28:51,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:28:51,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:28:51,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:28:51,609 INFO L87 Difference]: Start difference. First operand 166 states and 195 transitions. Second operand 9 states. [2018-11-18 22:28:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:54,320 INFO L93 Difference]: Finished difference Result 199 states and 227 transitions. [2018-11-18 22:28:54,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:28:54,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-18 22:28:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:28:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:28:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2018-11-18 22:28:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:28:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2018-11-18 22:28:54,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 208 transitions. [2018-11-18 22:28:54,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:54,562 INFO L225 Difference]: With dead ends: 199 [2018-11-18 22:28:54,562 INFO L226 Difference]: Without dead ends: 194 [2018-11-18 22:28:54,563 INFO L604 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-18 22:28:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-18 22:28:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2018-11-18 22:28:54,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:28:54,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 164 states. [2018-11-18 22:28:54,624 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 164 states. [2018-11-18 22:28:54,625 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 164 states. [2018-11-18 22:28:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:54,629 INFO L93 Difference]: Finished difference Result 194 states and 222 transitions. [2018-11-18 22:28:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2018-11-18 22:28:54,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:54,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:54,629 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 194 states. [2018-11-18 22:28:54,629 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 194 states. [2018-11-18 22:28:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:54,632 INFO L93 Difference]: Finished difference Result 194 states and 222 transitions. [2018-11-18 22:28:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2018-11-18 22:28:54,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:54,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:54,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:28:54,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:28:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-18 22:28:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 192 transitions. [2018-11-18 22:28:54,634 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 192 transitions. Word has length 28 [2018-11-18 22:28:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:28:54,635 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 192 transitions. [2018-11-18 22:28:54,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:28:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 192 transitions. [2018-11-18 22:28:54,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 22:28:54,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:28:54,635 INFO L375 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-18 22:28:54,635 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:28:54,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:28:54,636 INFO L82 PathProgramCache]: Analyzing trace with hash -186509162, now seen corresponding path program 1 times [2018-11-18 22:28:54,636 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:28:54,636 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:28:54,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:28:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:54,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:28:54,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-18 22:28:54,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {31721#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {31721#true} is VALID [2018-11-18 22:28:54,816 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-18 22:28:54,817 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #388#return; {31721#true} is VALID [2018-11-18 22:28:54,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret15 := main(); {31721#true} is VALID [2018-11-18 22:28:54,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {31721#true} is VALID [2018-11-18 22:28:54,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {31721#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {31744#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {31744#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {31744#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {31744#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {31744#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,819 INFO L273 TraceCheckUtils]: 9: Hoare triple {31744#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {31744#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {31744#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31757#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {31757#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {31757#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {31757#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {31757#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {31757#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {31757#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {31757#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31770#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {31770#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {31770#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,822 INFO L273 TraceCheckUtils]: 16: Hoare triple {31770#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {31770#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,823 INFO L273 TraceCheckUtils]: 17: Hoare triple {31770#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {31770#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,824 INFO L273 TraceCheckUtils]: 18: Hoare triple {31770#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31783#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,824 INFO L273 TraceCheckUtils]: 19: Hoare triple {31783#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {31783#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,825 INFO L273 TraceCheckUtils]: 20: Hoare triple {31783#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {31783#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,825 INFO L273 TraceCheckUtils]: 21: Hoare triple {31783#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {31783#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,826 INFO L273 TraceCheckUtils]: 22: Hoare triple {31783#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {31796#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,826 INFO L273 TraceCheckUtils]: 23: Hoare triple {31796#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {31796#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:28:54,827 INFO L273 TraceCheckUtils]: 24: Hoare triple {31796#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {31803#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:28:54,828 INFO L273 TraceCheckUtils]: 25: Hoare triple {31803#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {31807#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:28:54,828 INFO L273 TraceCheckUtils]: 26: Hoare triple {31807#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {31722#false} is VALID [2018-11-18 22:28:54,829 INFO L273 TraceCheckUtils]: 27: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-18 22:28:54,830 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-18 22:28:54,830 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (43)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 22:28:54,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:28:54,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 22:28:54,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-18 22:28:54,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:28:54,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:28:54,871 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-18 22:28:54,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:28:54,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:28:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:28:54,872 INFO L87 Difference]: Start difference. First operand 164 states and 192 transitions. Second operand 9 states. [2018-11-18 22:28:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:57,535 INFO L93 Difference]: Finished difference Result 194 states and 222 transitions. [2018-11-18 22:28:57,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:28:57,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-18 22:28:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:28:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:28:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2018-11-18 22:28:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:28:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2018-11-18 22:28:57,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 203 transitions. [2018-11-18 22:28:57,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:28:57,775 INFO L225 Difference]: With dead ends: 194 [2018-11-18 22:28:57,775 INFO L226 Difference]: Without dead ends: 190 [2018-11-18 22:28:57,776 INFO L604 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-18 22:28:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-18 22:28:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2018-11-18 22:28:57,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:28:57,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 163 states. [2018-11-18 22:28:57,816 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 163 states. [2018-11-18 22:28:57,816 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 163 states. [2018-11-18 22:28:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:57,820 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-11-18 22:28:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2018-11-18 22:28:57,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:57,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:57,820 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 190 states. [2018-11-18 22:28:57,820 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 190 states. [2018-11-18 22:28:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:28:57,823 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-11-18 22:28:57,823 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2018-11-18 22:28:57,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:28:57,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:28:57,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:28:57,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:28:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-18 22:28:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2018-11-18 22:28:57,826 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 28 [2018-11-18 22:28:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:28:57,826 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2018-11-18 22:28:57,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:28:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2018-11-18 22:28:57,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 22:28:57,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:28:57,827 INFO L375 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-18 22:28:57,827 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:28:57,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:28:57,827 INFO L82 PathProgramCache]: Analyzing trace with hash 945669773, now seen corresponding path program 1 times [2018-11-18 22:28:57,827 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:28:57,827 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:28:57,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:28:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:28:57,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:28:58,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {32589#true} call ULTIMATE.init(); {32589#true} is VALID [2018-11-18 22:28:58,171 INFO L273 TraceCheckUtils]: 1: Hoare triple {32589#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {32589#true} is VALID [2018-11-18 22:28:58,171 INFO L273 TraceCheckUtils]: 2: Hoare triple {32589#true} assume true; {32589#true} is VALID [2018-11-18 22:28:58,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32589#true} {32589#true} #388#return; {32589#true} is VALID [2018-11-18 22:28:58,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {32589#true} call #t~ret15 := main(); {32589#true} is VALID [2018-11-18 22:28:58,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {32589#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {32589#true} is VALID [2018-11-18 22:28:58,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {32589#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {32612#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,172 INFO L273 TraceCheckUtils]: 7: Hoare triple {32612#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {32612#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {32612#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {32612#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,173 INFO L273 TraceCheckUtils]: 9: Hoare triple {32612#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {32612#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {32612#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {32625#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {32625#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {32625#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {32625#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {32625#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {32625#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {32625#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {32625#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {32638#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {32638#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {32638#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {32638#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {32638#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {32638#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {32638#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {32638#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {32651#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,177 INFO L273 TraceCheckUtils]: 19: Hoare triple {32651#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {32651#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {32651#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {32651#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,178 INFO L273 TraceCheckUtils]: 21: Hoare triple {32651#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {32651#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {32651#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {32651#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,179 INFO L273 TraceCheckUtils]: 23: Hoare triple {32651#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {32651#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {32651#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {32670#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:28:58,181 INFO L273 TraceCheckUtils]: 25: Hoare triple {32670#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {32674#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:28:58,181 INFO L273 TraceCheckUtils]: 26: Hoare triple {32674#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {32590#false} is VALID [2018-11-18 22:28:58,182 INFO L273 TraceCheckUtils]: 27: Hoare triple {32590#false} assume !false; {32590#false} is VALID [2018-11-18 22:28:58,183 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-18 22:28:58,183 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:28:58,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:28:58,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 22:28:58,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-18 22:28:58,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:28:58,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:28:58,223 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-18 22:28:58,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:28:58,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:28:58,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:28:58,224 INFO L87 Difference]: Start difference. First operand 163 states and 190 transitions. Second operand 8 states. [2018-11-18 22:29:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:00,730 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-11-18 22:29:00,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:29:00,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-18 22:29:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:29:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2018-11-18 22:29:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:29:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2018-11-18 22:29:00,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 199 transitions. [2018-11-18 22:29:00,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:00,969 INFO L225 Difference]: With dead ends: 190 [2018-11-18 22:29:00,970 INFO L226 Difference]: Without dead ends: 188 [2018-11-18 22:29:00,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:29:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-18 22:29:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 166. [2018-11-18 22:29:01,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:01,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 166 states. [2018-11-18 22:29:01,010 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 166 states. [2018-11-18 22:29:01,010 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 166 states. [2018-11-18 22:29:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:01,015 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2018-11-18 22:29:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2018-11-18 22:29:01,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:01,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:01,015 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 188 states. [2018-11-18 22:29:01,016 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 188 states. [2018-11-18 22:29:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:01,018 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2018-11-18 22:29:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2018-11-18 22:29:01,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:01,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:01,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:01,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-18 22:29:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 194 transitions. [2018-11-18 22:29:01,021 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 194 transitions. Word has length 28 [2018-11-18 22:29:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:01,021 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 194 transitions. [2018-11-18 22:29:01,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:29:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 194 transitions. [2018-11-18 22:29:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 22:29:01,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:01,022 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:29:01,022 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:01,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:01,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1473548689, now seen corresponding path program 1 times [2018-11-18 22:29:01,023 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:01,023 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:01,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:01,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:01,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {33451#true} call ULTIMATE.init(); {33451#true} is VALID [2018-11-18 22:29:01,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {33451#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {33451#true} is VALID [2018-11-18 22:29:01,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {33451#true} assume true; {33451#true} is VALID [2018-11-18 22:29:01,297 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33451#true} {33451#true} #388#return; {33451#true} is VALID [2018-11-18 22:29:01,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {33451#true} call #t~ret15 := main(); {33451#true} is VALID [2018-11-18 22:29:01,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {33451#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {33451#true} is VALID [2018-11-18 22:29:01,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {33451#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {33474#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {33474#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {33474#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {33474#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {33474#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {33474#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {33474#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {33474#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33487#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {33487#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {33487#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {33487#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {33487#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {33487#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {33487#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {33487#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33500#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {33500#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {33500#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {33500#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {33500#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {33500#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {33500#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {33500#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33513#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,314 INFO L273 TraceCheckUtils]: 19: Hoare triple {33513#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {33513#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,314 INFO L273 TraceCheckUtils]: 20: Hoare triple {33513#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {33513#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {33513#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {33513#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {33513#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {33526#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,319 INFO L273 TraceCheckUtils]: 23: Hoare triple {33526#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {33526#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,319 INFO L273 TraceCheckUtils]: 24: Hoare triple {33526#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {33526#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,321 INFO L273 TraceCheckUtils]: 25: Hoare triple {33526#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {33526#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:01,321 INFO L273 TraceCheckUtils]: 26: Hoare triple {33526#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {33539#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:01,323 INFO L273 TraceCheckUtils]: 27: Hoare triple {33539#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {33452#false} is VALID [2018-11-18 22:29:01,323 INFO L273 TraceCheckUtils]: 28: Hoare triple {33452#false} assume !false; {33452#false} is VALID [2018-11-18 22:29:01,323 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-18 22:29:01,324 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:01,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:01,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 22:29:01,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-18 22:29:01,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:01,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:29:01,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:01,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:29:01,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:29:01,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:29:01,376 INFO L87 Difference]: Start difference. First operand 166 states and 194 transitions. Second operand 8 states. [2018-11-18 22:29:04,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:04,255 INFO L93 Difference]: Finished difference Result 247 states and 281 transitions. [2018-11-18 22:29:04,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:29:04,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-18 22:29:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:29:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 259 transitions. [2018-11-18 22:29:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:29:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 259 transitions. [2018-11-18 22:29:04,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 259 transitions. [2018-11-18 22:29:04,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:04,565 INFO L225 Difference]: With dead ends: 247 [2018-11-18 22:29:04,565 INFO L226 Difference]: Without dead ends: 245 [2018-11-18 22:29:04,566 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:29:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-11-18 22:29:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 169. [2018-11-18 22:29:04,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:04,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand 169 states. [2018-11-18 22:29:04,606 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand 169 states. [2018-11-18 22:29:04,606 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 169 states. [2018-11-18 22:29:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:04,611 INFO L93 Difference]: Finished difference Result 245 states and 279 transitions. [2018-11-18 22:29:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 279 transitions. [2018-11-18 22:29:04,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:04,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:04,611 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 245 states. [2018-11-18 22:29:04,612 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 245 states. [2018-11-18 22:29:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:04,615 INFO L93 Difference]: Finished difference Result 245 states and 279 transitions. [2018-11-18 22:29:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 279 transitions. [2018-11-18 22:29:04,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:04,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:04,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:04,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-18 22:29:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 199 transitions. [2018-11-18 22:29:04,618 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 199 transitions. Word has length 29 [2018-11-18 22:29:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:04,618 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 199 transitions. [2018-11-18 22:29:04,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:29:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 199 transitions. [2018-11-18 22:29:04,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 22:29:04,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:04,619 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:29:04,619 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:04,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:04,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1472009489, now seen corresponding path program 1 times [2018-11-18 22:29:04,619 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:04,619 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:04,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:04,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:04,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {34504#true} call ULTIMATE.init(); {34504#true} is VALID [2018-11-18 22:29:04,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {34504#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {34504#true} is VALID [2018-11-18 22:29:04,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {34504#true} assume true; {34504#true} is VALID [2018-11-18 22:29:04,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34504#true} {34504#true} #388#return; {34504#true} is VALID [2018-11-18 22:29:04,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {34504#true} call #t~ret15 := main(); {34504#true} is VALID [2018-11-18 22:29:04,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {34504#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {34504#true} is VALID [2018-11-18 22:29:04,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {34504#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {34527#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {34527#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {34527#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {34527#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {34527#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {34527#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {34527#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {34527#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34540#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {34540#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {34540#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {34540#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {34540#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {34540#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {34540#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {34540#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34553#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,800 INFO L273 TraceCheckUtils]: 15: Hoare triple {34553#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {34553#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {34553#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {34553#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {34553#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {34553#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,802 INFO L273 TraceCheckUtils]: 18: Hoare triple {34553#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34566#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {34566#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {34566#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,803 INFO L273 TraceCheckUtils]: 20: Hoare triple {34566#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {34566#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,804 INFO L273 TraceCheckUtils]: 21: Hoare triple {34566#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {34566#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,804 INFO L273 TraceCheckUtils]: 22: Hoare triple {34566#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {34579#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,805 INFO L273 TraceCheckUtils]: 23: Hoare triple {34579#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {34579#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,805 INFO L273 TraceCheckUtils]: 24: Hoare triple {34579#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {34579#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,806 INFO L273 TraceCheckUtils]: 25: Hoare triple {34579#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {34579#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:04,806 INFO L273 TraceCheckUtils]: 26: Hoare triple {34579#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {34592#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:04,807 INFO L273 TraceCheckUtils]: 27: Hoare triple {34592#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~12; {34505#false} is VALID [2018-11-18 22:29:04,807 INFO L273 TraceCheckUtils]: 28: Hoare triple {34505#false} assume !false; {34505#false} is VALID [2018-11-18 22:29:04,808 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-18 22:29:04,809 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:04,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:04,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 22:29:04,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-18 22:29:04,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:04,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:29:04,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:04,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:29:04,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:29:04,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:29:04,846 INFO L87 Difference]: Start difference. First operand 169 states and 199 transitions. Second operand 8 states. [2018-11-18 22:29:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:07,409 INFO L93 Difference]: Finished difference Result 186 states and 214 transitions. [2018-11-18 22:29:07,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:29:07,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-18 22:29:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:29:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2018-11-18 22:29:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:29:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2018-11-18 22:29:07,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 195 transitions. [2018-11-18 22:29:07,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:07,662 INFO L225 Difference]: With dead ends: 186 [2018-11-18 22:29:07,662 INFO L226 Difference]: Without dead ends: 183 [2018-11-18 22:29:07,662 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:29:07,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-18 22:29:07,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2018-11-18 22:29:07,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:07,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand 170 states. [2018-11-18 22:29:07,712 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 170 states. [2018-11-18 22:29:07,712 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 170 states. [2018-11-18 22:29:07,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:07,715 INFO L93 Difference]: Finished difference Result 183 states and 211 transitions. [2018-11-18 22:29:07,715 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2018-11-18 22:29:07,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:07,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:07,716 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 183 states. [2018-11-18 22:29:07,716 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 183 states. [2018-11-18 22:29:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:07,718 INFO L93 Difference]: Finished difference Result 183 states and 211 transitions. [2018-11-18 22:29:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2018-11-18 22:29:07,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:07,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:07,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:07,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-18 22:29:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 200 transitions. [2018-11-18 22:29:07,721 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 200 transitions. Word has length 29 [2018-11-18 22:29:07,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:07,721 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 200 transitions. [2018-11-18 22:29:07,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:29:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 200 transitions. [2018-11-18 22:29:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 22:29:07,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:07,722 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:29:07,722 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:07,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:07,722 INFO L82 PathProgramCache]: Analyzing trace with hash -748577978, now seen corresponding path program 1 times [2018-11-18 22:29:07,722 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:07,723 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:07,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:07,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:07,911 INFO L256 TraceCheckUtils]: 0: Hoare triple {35359#true} call ULTIMATE.init(); {35359#true} is VALID [2018-11-18 22:29:07,911 INFO L273 TraceCheckUtils]: 1: Hoare triple {35359#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {35359#true} is VALID [2018-11-18 22:29:07,912 INFO L273 TraceCheckUtils]: 2: Hoare triple {35359#true} assume true; {35359#true} is VALID [2018-11-18 22:29:07,912 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35359#true} {35359#true} #388#return; {35359#true} is VALID [2018-11-18 22:29:07,912 INFO L256 TraceCheckUtils]: 4: Hoare triple {35359#true} call #t~ret15 := main(); {35359#true} is VALID [2018-11-18 22:29:07,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {35359#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {35359#true} is VALID [2018-11-18 22:29:07,913 INFO L273 TraceCheckUtils]: 6: Hoare triple {35359#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {35382#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {35382#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {35382#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {35382#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {35382#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {35382#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {35382#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {35382#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {35395#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {35395#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {35395#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {35395#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {35395#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {35395#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {35395#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {35395#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {35408#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {35408#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {35408#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {35408#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {35408#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {35408#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {35408#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,919 INFO L273 TraceCheckUtils]: 18: Hoare triple {35408#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {35421#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,919 INFO L273 TraceCheckUtils]: 19: Hoare triple {35421#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {35421#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,920 INFO L273 TraceCheckUtils]: 20: Hoare triple {35421#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {35421#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {35421#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {35421#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,921 INFO L273 TraceCheckUtils]: 22: Hoare triple {35421#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {35421#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,921 INFO L273 TraceCheckUtils]: 23: Hoare triple {35421#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {35421#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {35421#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {35440#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,922 INFO L273 TraceCheckUtils]: 25: Hoare triple {35440#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {35440#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:07,923 INFO L273 TraceCheckUtils]: 26: Hoare triple {35440#(= (_ bv4 32) main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {35447#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:07,924 INFO L273 TraceCheckUtils]: 27: Hoare triple {35447#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {35360#false} is VALID [2018-11-18 22:29:07,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {35360#false} assume !false; {35360#false} is VALID [2018-11-18 22:29:07,925 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-18 22:29:07,925 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:07,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:07,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 22:29:07,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-18 22:29:07,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:07,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:29:07,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:07,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:29:07,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:29:07,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:29:07,966 INFO L87 Difference]: Start difference. First operand 170 states and 200 transitions. Second operand 8 states. [2018-11-18 22:29:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:10,992 INFO L93 Difference]: Finished difference Result 226 states and 258 transitions. [2018-11-18 22:29:10,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:29:10,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-18 22:29:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:29:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 256 transitions. [2018-11-18 22:29:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:29:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 256 transitions. [2018-11-18 22:29:10,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 256 transitions. [2018-11-18 22:29:11,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:11,304 INFO L225 Difference]: With dead ends: 226 [2018-11-18 22:29:11,305 INFO L226 Difference]: Without dead ends: 224 [2018-11-18 22:29:11,305 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:29:11,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-18 22:29:11,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2018-11-18 22:29:11,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:11,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand 172 states. [2018-11-18 22:29:11,424 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand 172 states. [2018-11-18 22:29:11,424 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 172 states. [2018-11-18 22:29:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:11,429 INFO L93 Difference]: Finished difference Result 224 states and 256 transitions. [2018-11-18 22:29:11,429 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 256 transitions. [2018-11-18 22:29:11,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:11,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:11,429 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 224 states. [2018-11-18 22:29:11,429 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 224 states. [2018-11-18 22:29:11,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:11,433 INFO L93 Difference]: Finished difference Result 224 states and 256 transitions. [2018-11-18 22:29:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 256 transitions. [2018-11-18 22:29:11,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:11,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:11,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:11,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-18 22:29:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 202 transitions. [2018-11-18 22:29:11,435 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 202 transitions. Word has length 29 [2018-11-18 22:29:11,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:11,436 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 202 transitions. [2018-11-18 22:29:11,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:29:11,436 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 202 transitions. [2018-11-18 22:29:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 22:29:11,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:11,436 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:29:11,436 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:11,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:11,437 INFO L82 PathProgramCache]: Analyzing trace with hash -749004982, now seen corresponding path program 1 times [2018-11-18 22:29:11,437 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:11,437 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:11,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:11,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:11,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {36350#true} call ULTIMATE.init(); {36350#true} is VALID [2018-11-18 22:29:11,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {36350#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {36350#true} is VALID [2018-11-18 22:29:11,734 INFO L273 TraceCheckUtils]: 2: Hoare triple {36350#true} assume true; {36350#true} is VALID [2018-11-18 22:29:11,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36350#true} {36350#true} #388#return; {36350#true} is VALID [2018-11-18 22:29:11,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {36350#true} call #t~ret15 := main(); {36350#true} is VALID [2018-11-18 22:29:11,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {36350#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {36350#true} is VALID [2018-11-18 22:29:11,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {36350#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {36373#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,735 INFO L273 TraceCheckUtils]: 7: Hoare triple {36373#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {36373#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {36373#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {36373#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {36373#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {36373#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {36373#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {36386#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {36386#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {36386#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {36386#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {36386#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,743 INFO L273 TraceCheckUtils]: 13: Hoare triple {36386#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {36386#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {36386#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {36399#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {36399#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {36399#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,747 INFO L273 TraceCheckUtils]: 16: Hoare triple {36399#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {36399#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {36399#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~20);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {36399#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {36399#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~21);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {36412#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {36412#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {36412#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,751 INFO L273 TraceCheckUtils]: 20: Hoare triple {36412#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {36412#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,751 INFO L273 TraceCheckUtils]: 21: Hoare triple {36412#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {36412#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {36412#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {36412#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {36412#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {36412#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,755 INFO L273 TraceCheckUtils]: 24: Hoare triple {36412#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {36431#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:11,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {36431#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {36435#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:29:11,757 INFO L273 TraceCheckUtils]: 26: Hoare triple {36435#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {36439#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:11,757 INFO L273 TraceCheckUtils]: 27: Hoare triple {36439#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {36351#false} is VALID [2018-11-18 22:29:11,757 INFO L273 TraceCheckUtils]: 28: Hoare triple {36351#false} assume !false; {36351#false} is VALID [2018-11-18 22:29:11,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-18 22:29:11,758 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:11,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:11,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 22:29:11,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-18 22:29:11,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:11,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:29:11,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:11,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:29:11,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:29:11,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:29:11,815 INFO L87 Difference]: Start difference. First operand 172 states and 202 transitions. Second operand 9 states. [2018-11-18 22:29:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:14,781 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2018-11-18 22:29:14,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:29:14,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-18 22:29:14,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2018-11-18 22:29:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2018-11-18 22:29:14,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2018-11-18 22:29:15,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:15,056 INFO L225 Difference]: With dead ends: 181 [2018-11-18 22:29:15,057 INFO L226 Difference]: Without dead ends: 177 [2018-11-18 22:29:15,057 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:29:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-18 22:29:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2018-11-18 22:29:15,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:15,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 171 states. [2018-11-18 22:29:15,108 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 171 states. [2018-11-18 22:29:15,108 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 171 states. [2018-11-18 22:29:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:15,112 INFO L93 Difference]: Finished difference Result 177 states and 205 transitions. [2018-11-18 22:29:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2018-11-18 22:29:15,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:15,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:15,113 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 177 states. [2018-11-18 22:29:15,113 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 177 states. [2018-11-18 22:29:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:15,115 INFO L93 Difference]: Finished difference Result 177 states and 205 transitions. [2018-11-18 22:29:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2018-11-18 22:29:15,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:15,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:15,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:15,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:15,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-18 22:29:15,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 200 transitions. [2018-11-18 22:29:15,118 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 200 transitions. Word has length 29 [2018-11-18 22:29:15,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:15,118 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 200 transitions. [2018-11-18 22:29:15,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:29:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 200 transitions. [2018-11-18 22:29:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 22:29:15,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:15,119 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:29:15,119 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:15,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:15,119 INFO L82 PathProgramCache]: Analyzing trace with hash -791316104, now seen corresponding path program 1 times [2018-11-18 22:29:15,119 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:15,120 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:15,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:15,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:15,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {37191#true} call ULTIMATE.init(); {37191#true} is VALID [2018-11-18 22:29:15,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {37191#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {37191#true} is VALID [2018-11-18 22:29:15,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {37191#true} assume true; {37191#true} is VALID [2018-11-18 22:29:15,510 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37191#true} {37191#true} #388#return; {37191#true} is VALID [2018-11-18 22:29:15,510 INFO L256 TraceCheckUtils]: 4: Hoare triple {37191#true} call #t~ret15 := main(); {37191#true} is VALID [2018-11-18 22:29:15,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {37191#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {37191#true} is VALID [2018-11-18 22:29:15,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {37191#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {37214#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:15,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {37214#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {37214#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:15,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {37214#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {37214#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:15,513 INFO L273 TraceCheckUtils]: 9: Hoare triple {37214#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {37224#(and (= (_ bv0 32) main_~main__t~0) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-18 22:29:15,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {37224#(and (= (_ bv0 32) main_~main__t~0) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:29:15,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:29:15,515 INFO L273 TraceCheckUtils]: 12: Hoare triple {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:29:15,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:29:15,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:29:15,518 INFO L273 TraceCheckUtils]: 15: Hoare triple {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-18 22:29:15,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {37228#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37247#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:29:15,519 INFO L273 TraceCheckUtils]: 17: Hoare triple {37247#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0); {37251#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:29:15,520 INFO L273 TraceCheckUtils]: 18: Hoare triple {37251#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {37251#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-18 22:29:15,523 INFO L273 TraceCheckUtils]: 19: Hoare triple {37251#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {37258#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-18 22:29:15,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {37258#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~11);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {37262#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:29:15,525 INFO L273 TraceCheckUtils]: 21: Hoare triple {37262#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {37262#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:29:15,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {37262#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:29:15,526 INFO L273 TraceCheckUtils]: 23: Hoare triple {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:29:15,526 INFO L273 TraceCheckUtils]: 24: Hoare triple {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:29:15,527 INFO L273 TraceCheckUtils]: 25: Hoare triple {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:29:15,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {37269#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {37282#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:15,529 INFO L273 TraceCheckUtils]: 27: Hoare triple {37282#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {37192#false} is VALID [2018-11-18 22:29:15,530 INFO L273 TraceCheckUtils]: 28: Hoare triple {37192#false} assume !false; {37192#false} is VALID [2018-11-18 22:29:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:29:15,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:29:15,743 INFO L273 TraceCheckUtils]: 28: Hoare triple {37192#false} assume !false; {37192#false} is VALID [2018-11-18 22:29:15,743 INFO L273 TraceCheckUtils]: 27: Hoare triple {37292#(not (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {37192#false} is VALID [2018-11-18 22:29:15,744 INFO L273 TraceCheckUtils]: 26: Hoare triple {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {37292#(not (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} is VALID [2018-11-18 22:29:15,745 INFO L273 TraceCheckUtils]: 25: Hoare triple {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:29:15,745 INFO L273 TraceCheckUtils]: 24: Hoare triple {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:29:15,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:29:15,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:29:15,747 INFO L273 TraceCheckUtils]: 21: Hoare triple {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:29:15,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {37315#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~11);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {37296#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-18 22:29:15,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {37319#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {37315#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} is VALID [2018-11-18 22:29:15,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {37319#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {37319#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:29:15,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {37191#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {37319#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2018-11-18 22:29:15,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {37191#true} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37191#true} is VALID [2018-11-18 22:29:15,777 INFO L273 TraceCheckUtils]: 15: Hoare triple {37191#true} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {37191#true} is VALID [2018-11-18 22:29:15,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {37191#true} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {37191#true} is VALID [2018-11-18 22:29:15,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {37191#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37191#true} is VALID [2018-11-18 22:29:15,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {37191#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {37191#true} is VALID [2018-11-18 22:29:15,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {37191#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {37191#true} is VALID [2018-11-18 22:29:15,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {37191#true} assume !(0bv32 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {37191#true} is VALID [2018-11-18 22:29:15,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {37191#true} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {37191#true} is VALID [2018-11-18 22:29:15,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {37191#true} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {37191#true} is VALID [2018-11-18 22:29:15,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {37191#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {37191#true} is VALID [2018-11-18 22:29:15,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {37191#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {37191#true} is VALID [2018-11-18 22:29:15,778 INFO L273 TraceCheckUtils]: 5: Hoare triple {37191#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {37191#true} is VALID [2018-11-18 22:29:15,778 INFO L256 TraceCheckUtils]: 4: Hoare triple {37191#true} call #t~ret15 := main(); {37191#true} is VALID [2018-11-18 22:29:15,778 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37191#true} {37191#true} #388#return; {37191#true} is VALID [2018-11-18 22:29:15,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {37191#true} assume true; {37191#true} is VALID [2018-11-18 22:29:15,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {37191#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {37191#true} is VALID [2018-11-18 22:29:15,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {37191#true} call ULTIMATE.init(); {37191#true} is VALID [2018-11-18 22:29:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:29:15,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:29:15,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2018-11-18 22:29:15,781 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-18 22:29:15,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:15,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:29:15,867 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-18 22:29:15,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:29:15,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:29:15,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:29:15,868 INFO L87 Difference]: Start difference. First operand 171 states and 200 transitions. Second operand 15 states. [2018-11-18 22:29:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:23,104 INFO L93 Difference]: Finished difference Result 214 states and 247 transitions. [2018-11-18 22:29:23,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 22:29:23,104 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-18 22:29:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:29:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 224 transitions. [2018-11-18 22:29:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:29:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 224 transitions. [2018-11-18 22:29:23,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 224 transitions. [2018-11-18 22:29:23,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:23,674 INFO L225 Difference]: With dead ends: 214 [2018-11-18 22:29:23,674 INFO L226 Difference]: Without dead ends: 212 [2018-11-18 22:29:23,674 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:29:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-18 22:29:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 154. [2018-11-18 22:29:23,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:23,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand 154 states. [2018-11-18 22:29:23,714 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 154 states. [2018-11-18 22:29:23,715 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 154 states. [2018-11-18 22:29:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:23,719 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2018-11-18 22:29:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 244 transitions. [2018-11-18 22:29:23,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:23,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:23,719 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 212 states. [2018-11-18 22:29:23,719 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 212 states. [2018-11-18 22:29:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:23,722 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2018-11-18 22:29:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 244 transitions. [2018-11-18 22:29:23,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:23,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:23,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:23,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-18 22:29:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2018-11-18 22:29:23,725 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 29 [2018-11-18 22:29:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:23,725 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2018-11-18 22:29:23,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:29:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2018-11-18 22:29:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 22:29:23,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:23,725 INFO L375 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-18 22:29:23,726 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:23,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:23,726 INFO L82 PathProgramCache]: Analyzing trace with hash -280110353, now seen corresponding path program 1 times [2018-11-18 22:29:23,726 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:23,726 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:23,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:23,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:23,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {38253#true} call ULTIMATE.init(); {38253#true} is VALID [2018-11-18 22:29:23,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {38253#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {38253#true} is VALID [2018-11-18 22:29:23,923 INFO L273 TraceCheckUtils]: 2: Hoare triple {38253#true} assume true; {38253#true} is VALID [2018-11-18 22:29:23,923 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38253#true} {38253#true} #388#return; {38253#true} is VALID [2018-11-18 22:29:23,923 INFO L256 TraceCheckUtils]: 4: Hoare triple {38253#true} call #t~ret15 := main(); {38253#true} is VALID [2018-11-18 22:29:23,924 INFO L273 TraceCheckUtils]: 5: Hoare triple {38253#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {38253#true} is VALID [2018-11-18 22:29:23,924 INFO L273 TraceCheckUtils]: 6: Hoare triple {38253#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {38276#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {38276#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {38276#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {38276#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {38276#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {38276#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {38276#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {38276#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38289#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,927 INFO L273 TraceCheckUtils]: 11: Hoare triple {38289#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {38289#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {38289#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {38289#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {38289#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {38289#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,928 INFO L273 TraceCheckUtils]: 14: Hoare triple {38289#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38302#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {38302#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {38302#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,929 INFO L273 TraceCheckUtils]: 16: Hoare triple {38302#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {38302#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,929 INFO L273 TraceCheckUtils]: 17: Hoare triple {38302#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {38302#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {38302#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38315#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,930 INFO L273 TraceCheckUtils]: 19: Hoare triple {38315#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {38315#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,930 INFO L273 TraceCheckUtils]: 20: Hoare triple {38315#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {38315#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,931 INFO L273 TraceCheckUtils]: 21: Hoare triple {38315#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {38315#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {38315#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38328#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,932 INFO L273 TraceCheckUtils]: 23: Hoare triple {38328#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {38328#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,935 INFO L273 TraceCheckUtils]: 24: Hoare triple {38328#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_29~0;~__tmp_29~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~28;~__VERIFIER_assert__cond~28 := ~__tmp_29~0; {38328#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,936 INFO L273 TraceCheckUtils]: 25: Hoare triple {38328#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~28);havoc ~__tmp_30~0;~__tmp_30~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~29;~__VERIFIER_assert__cond~29 := ~__tmp_30~0; {38328#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,937 INFO L273 TraceCheckUtils]: 26: Hoare triple {38328#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~29);~main____CPAchecker_TMP_2~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~4;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~4; {38341#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,938 INFO L273 TraceCheckUtils]: 27: Hoare triple {38341#(= (_ bv5 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {38341#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:23,939 INFO L273 TraceCheckUtils]: 28: Hoare triple {38341#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {38348#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:23,939 INFO L273 TraceCheckUtils]: 29: Hoare triple {38348#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {38254#false} is VALID [2018-11-18 22:29:23,940 INFO L273 TraceCheckUtils]: 30: Hoare triple {38254#false} assume !false; {38254#false} is VALID [2018-11-18 22:29:23,941 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-18 22:29:23,941 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:23,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:23,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 22:29:23,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-18 22:29:23,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:23,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:29:23,987 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-18 22:29:23,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:29:23,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:29:23,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:29:23,988 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand 9 states. [2018-11-18 22:29:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:27,203 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2018-11-18 22:29:27,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:29:27,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-18 22:29:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2018-11-18 22:29:27,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2018-11-18 22:29:27,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 218 transitions. [2018-11-18 22:29:27,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:27,476 INFO L225 Difference]: With dead ends: 193 [2018-11-18 22:29:27,476 INFO L226 Difference]: Without dead ends: 191 [2018-11-18 22:29:27,476 INFO L604 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-18 22:29:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-18 22:29:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 158. [2018-11-18 22:29:27,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:27,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand 158 states. [2018-11-18 22:29:27,528 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 158 states. [2018-11-18 22:29:27,528 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 158 states. [2018-11-18 22:29:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:27,531 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2018-11-18 22:29:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2018-11-18 22:29:27,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:27,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:27,531 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 191 states. [2018-11-18 22:29:27,531 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 191 states. [2018-11-18 22:29:27,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:27,534 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2018-11-18 22:29:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2018-11-18 22:29:27,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:27,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:27,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:27,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:27,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-18 22:29:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2018-11-18 22:29:27,537 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 31 [2018-11-18 22:29:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:27,537 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2018-11-18 22:29:27,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:29:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2018-11-18 22:29:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 22:29:27,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:27,538 INFO L375 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-18 22:29:27,538 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:27,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:27,538 INFO L82 PathProgramCache]: Analyzing trace with hash 306565166, now seen corresponding path program 1 times [2018-11-18 22:29:27,538 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:27,538 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:27,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:27,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:27,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {39125#true} call ULTIMATE.init(); {39125#true} is VALID [2018-11-18 22:29:27,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {39125#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {39125#true} is VALID [2018-11-18 22:29:27,740 INFO L273 TraceCheckUtils]: 2: Hoare triple {39125#true} assume true; {39125#true} is VALID [2018-11-18 22:29:27,740 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39125#true} {39125#true} #388#return; {39125#true} is VALID [2018-11-18 22:29:27,741 INFO L256 TraceCheckUtils]: 4: Hoare triple {39125#true} call #t~ret15 := main(); {39125#true} is VALID [2018-11-18 22:29:27,741 INFO L273 TraceCheckUtils]: 5: Hoare triple {39125#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {39125#true} is VALID [2018-11-18 22:29:27,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {39125#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {39148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,741 INFO L273 TraceCheckUtils]: 7: Hoare triple {39148#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {39148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,742 INFO L273 TraceCheckUtils]: 8: Hoare triple {39148#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {39148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,742 INFO L273 TraceCheckUtils]: 9: Hoare triple {39148#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {39148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,742 INFO L273 TraceCheckUtils]: 10: Hoare triple {39148#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,743 INFO L273 TraceCheckUtils]: 11: Hoare triple {39161#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {39161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {39161#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {39161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,743 INFO L273 TraceCheckUtils]: 13: Hoare triple {39161#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {39161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {39161#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39174#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {39174#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {39174#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {39174#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {39174#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {39174#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {39174#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,747 INFO L273 TraceCheckUtils]: 18: Hoare triple {39174#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39187#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,747 INFO L273 TraceCheckUtils]: 19: Hoare triple {39187#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {39187#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {39187#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {39187#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,748 INFO L273 TraceCheckUtils]: 21: Hoare triple {39187#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {39187#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,749 INFO L273 TraceCheckUtils]: 22: Hoare triple {39187#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39200#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,750 INFO L273 TraceCheckUtils]: 23: Hoare triple {39200#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {39200#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,750 INFO L273 TraceCheckUtils]: 24: Hoare triple {39200#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_31~0;~__tmp_31~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {39200#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,751 INFO L273 TraceCheckUtils]: 25: Hoare triple {39200#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~30);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {39200#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,751 INFO L273 TraceCheckUtils]: 26: Hoare triple {39200#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~31);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39213#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,752 INFO L273 TraceCheckUtils]: 27: Hoare triple {39213#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {39213#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:27,753 INFO L273 TraceCheckUtils]: 28: Hoare triple {39213#(= (_ bv5 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {39220#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:27,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {39220#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {39126#false} is VALID [2018-11-18 22:29:27,754 INFO L273 TraceCheckUtils]: 30: Hoare triple {39126#false} assume !false; {39126#false} is VALID [2018-11-18 22:29:27,755 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-18 22:29:27,755 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:27,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:27,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 22:29:27,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-18 22:29:27,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:27,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:29:27,801 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-18 22:29:27,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:29:27,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:29:27,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:29:27,802 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand 9 states. [2018-11-18 22:29:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:30,895 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2018-11-18 22:29:30,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:29:30,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-18 22:29:30,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2018-11-18 22:29:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2018-11-18 22:29:30,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 216 transitions. [2018-11-18 22:29:31,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:31,157 INFO L225 Difference]: With dead ends: 191 [2018-11-18 22:29:31,157 INFO L226 Difference]: Without dead ends: 189 [2018-11-18 22:29:31,157 INFO L604 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-18 22:29:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-18 22:29:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 160. [2018-11-18 22:29:31,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:31,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 160 states. [2018-11-18 22:29:31,203 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 160 states. [2018-11-18 22:29:31,203 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 160 states. [2018-11-18 22:29:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:31,206 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2018-11-18 22:29:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 214 transitions. [2018-11-18 22:29:31,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:31,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:31,207 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 189 states. [2018-11-18 22:29:31,207 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 189 states. [2018-11-18 22:29:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:31,210 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2018-11-18 22:29:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 214 transitions. [2018-11-18 22:29:31,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:31,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:31,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:31,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-18 22:29:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 185 transitions. [2018-11-18 22:29:31,212 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 185 transitions. Word has length 31 [2018-11-18 22:29:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:31,213 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 185 transitions. [2018-11-18 22:29:31,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:29:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 185 transitions. [2018-11-18 22:29:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 22:29:31,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:31,213 INFO L375 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-18 22:29:31,213 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:31,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:31,214 INFO L82 PathProgramCache]: Analyzing trace with hash -93483259, now seen corresponding path program 1 times [2018-11-18 22:29:31,214 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:31,214 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:31,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:31,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:31,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {39994#true} call ULTIMATE.init(); {39994#true} is VALID [2018-11-18 22:29:31,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {39994#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {39994#true} is VALID [2018-11-18 22:29:31,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {39994#true} assume true; {39994#true} is VALID [2018-11-18 22:29:31,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39994#true} {39994#true} #388#return; {39994#true} is VALID [2018-11-18 22:29:31,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {39994#true} call #t~ret15 := main(); {39994#true} is VALID [2018-11-18 22:29:31,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {39994#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {39994#true} is VALID [2018-11-18 22:29:31,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {39994#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {40017#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {40017#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {40017#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {40017#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {40017#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,423 INFO L273 TraceCheckUtils]: 9: Hoare triple {40017#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {40017#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {40017#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40030#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {40030#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {40030#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {40030#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {40030#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {40030#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {40030#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {40030#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40043#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,426 INFO L273 TraceCheckUtils]: 15: Hoare triple {40043#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {40043#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,426 INFO L273 TraceCheckUtils]: 16: Hoare triple {40043#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {40043#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {40043#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {40043#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {40043#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40056#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,427 INFO L273 TraceCheckUtils]: 19: Hoare triple {40056#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {40056#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {40056#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {40056#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {40056#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {40056#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {40056#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40069#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,430 INFO L273 TraceCheckUtils]: 23: Hoare triple {40069#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {40069#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {40069#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_29~0;~__tmp_29~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~28;~__VERIFIER_assert__cond~28 := ~__tmp_29~0; {40069#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {40069#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~28);havoc ~__tmp_30~0;~__tmp_30~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~29;~__VERIFIER_assert__cond~29 := ~__tmp_30~0; {40069#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,431 INFO L273 TraceCheckUtils]: 26: Hoare triple {40069#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~29);~main____CPAchecker_TMP_2~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~4;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~4; {40082#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,432 INFO L273 TraceCheckUtils]: 27: Hoare triple {40082#(= (_ bv5 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {40082#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:31,432 INFO L273 TraceCheckUtils]: 28: Hoare triple {40082#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {40089#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:29:31,433 INFO L273 TraceCheckUtils]: 29: Hoare triple {40089#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {40093#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:31,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {40093#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {39995#false} is VALID [2018-11-18 22:29:31,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {39995#false} assume !false; {39995#false} is VALID [2018-11-18 22:29:31,435 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-18 22:29:31,435 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:31,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:31,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 22:29:31,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-18 22:29:31,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:31,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:29:31,487 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-18 22:29:31,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:29:31,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:29:31,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:29:31,489 INFO L87 Difference]: Start difference. First operand 160 states and 185 transitions. Second operand 10 states. [2018-11-18 22:29:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:34,735 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2018-11-18 22:29:34,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:29:34,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-18 22:29:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:29:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2018-11-18 22:29:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:29:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2018-11-18 22:29:34,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 214 transitions. [2018-11-18 22:29:34,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:34,996 INFO L225 Difference]: With dead ends: 189 [2018-11-18 22:29:34,997 INFO L226 Difference]: Without dead ends: 185 [2018-11-18 22:29:34,997 INFO L604 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-18 22:29:34,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-18 22:29:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2018-11-18 22:29:35,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:35,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 159 states. [2018-11-18 22:29:35,282 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 159 states. [2018-11-18 22:29:35,282 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 159 states. [2018-11-18 22:29:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:35,286 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2018-11-18 22:29:35,286 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2018-11-18 22:29:35,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:35,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:35,286 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 185 states. [2018-11-18 22:29:35,286 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 185 states. [2018-11-18 22:29:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:35,289 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2018-11-18 22:29:35,289 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2018-11-18 22:29:35,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:35,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:35,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:35,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-18 22:29:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2018-11-18 22:29:35,291 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 32 [2018-11-18 22:29:35,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:35,292 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2018-11-18 22:29:35,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:29:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2018-11-18 22:29:35,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 22:29:35,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:35,292 INFO L375 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-18 22:29:35,292 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:35,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:35,293 INFO L82 PathProgramCache]: Analyzing trace with hash 913588615, now seen corresponding path program 1 times [2018-11-18 22:29:35,293 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:35,293 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:35,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:35,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:35,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {40856#true} call ULTIMATE.init(); {40856#true} is VALID [2018-11-18 22:29:35,504 INFO L273 TraceCheckUtils]: 1: Hoare triple {40856#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {40856#true} is VALID [2018-11-18 22:29:35,504 INFO L273 TraceCheckUtils]: 2: Hoare triple {40856#true} assume true; {40856#true} is VALID [2018-11-18 22:29:35,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40856#true} {40856#true} #388#return; {40856#true} is VALID [2018-11-18 22:29:35,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {40856#true} call #t~ret15 := main(); {40856#true} is VALID [2018-11-18 22:29:35,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {40856#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {40856#true} is VALID [2018-11-18 22:29:35,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {40856#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {40879#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {40879#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {40879#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {40879#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {40879#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {40879#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {40879#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {40879#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40892#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,507 INFO L273 TraceCheckUtils]: 11: Hoare triple {40892#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {40892#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,507 INFO L273 TraceCheckUtils]: 12: Hoare triple {40892#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {40892#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,508 INFO L273 TraceCheckUtils]: 13: Hoare triple {40892#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {40892#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,508 INFO L273 TraceCheckUtils]: 14: Hoare triple {40892#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40905#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {40905#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {40905#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {40905#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {40905#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {40905#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {40905#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {40905#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40918#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,511 INFO L273 TraceCheckUtils]: 19: Hoare triple {40918#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {40918#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {40918#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {40918#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,512 INFO L273 TraceCheckUtils]: 21: Hoare triple {40918#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {40918#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,512 INFO L273 TraceCheckUtils]: 22: Hoare triple {40918#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40931#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,513 INFO L273 TraceCheckUtils]: 23: Hoare triple {40931#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {40931#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,514 INFO L273 TraceCheckUtils]: 24: Hoare triple {40931#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_31~0;~__tmp_31~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {40931#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,514 INFO L273 TraceCheckUtils]: 25: Hoare triple {40931#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~30);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {40931#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {40931#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~31);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40944#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:35,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {40944#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {40948#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:29:35,516 INFO L273 TraceCheckUtils]: 28: Hoare triple {40948#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {40948#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:29:35,517 INFO L273 TraceCheckUtils]: 29: Hoare triple {40948#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {40955#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:35,518 INFO L273 TraceCheckUtils]: 30: Hoare triple {40955#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {40857#false} is VALID [2018-11-18 22:29:35,518 INFO L273 TraceCheckUtils]: 31: Hoare triple {40857#false} assume !false; {40857#false} is VALID [2018-11-18 22:29:35,520 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-18 22:29:35,520 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:35,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:35,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 22:29:35,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-18 22:29:35,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:35,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:29:35,564 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-18 22:29:35,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:29:35,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:29:35,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:29:35,565 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand 10 states. [2018-11-18 22:29:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:38,824 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2018-11-18 22:29:38,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:29:38,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-18 22:29:38,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:29:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2018-11-18 22:29:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:29:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2018-11-18 22:29:38,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 210 transitions. [2018-11-18 22:29:39,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:39,082 INFO L225 Difference]: With dead ends: 185 [2018-11-18 22:29:39,082 INFO L226 Difference]: Without dead ends: 180 [2018-11-18 22:29:39,082 INFO L604 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-18 22:29:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-18 22:29:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 157. [2018-11-18 22:29:39,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:39,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand 157 states. [2018-11-18 22:29:39,131 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 157 states. [2018-11-18 22:29:39,132 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 157 states. [2018-11-18 22:29:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:39,135 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2018-11-18 22:29:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 205 transitions. [2018-11-18 22:29:39,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:39,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:39,137 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 180 states. [2018-11-18 22:29:39,137 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 180 states. [2018-11-18 22:29:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:39,139 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2018-11-18 22:29:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 205 transitions. [2018-11-18 22:29:39,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:39,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:39,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:39,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 22:29:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2018-11-18 22:29:39,142 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 32 [2018-11-18 22:29:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:39,142 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2018-11-18 22:29:39,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:29:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2018-11-18 22:29:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 22:29:39,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:39,142 INFO L375 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-18 22:29:39,142 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:39,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:39,143 INFO L82 PathProgramCache]: Analyzing trace with hash 374825852, now seen corresponding path program 1 times [2018-11-18 22:29:39,143 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:39,143 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:39,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:39,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:39,335 INFO L256 TraceCheckUtils]: 0: Hoare triple {41701#true} call ULTIMATE.init(); {41701#true} is VALID [2018-11-18 22:29:39,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {41701#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {41701#true} is VALID [2018-11-18 22:29:39,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {41701#true} assume true; {41701#true} is VALID [2018-11-18 22:29:39,336 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41701#true} {41701#true} #388#return; {41701#true} is VALID [2018-11-18 22:29:39,336 INFO L256 TraceCheckUtils]: 4: Hoare triple {41701#true} call #t~ret15 := main(); {41701#true} is VALID [2018-11-18 22:29:39,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {41701#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {41701#true} is VALID [2018-11-18 22:29:39,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {41701#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {41724#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {41724#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {41724#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {41724#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {41724#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {41724#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {41724#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {41724#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {41737#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,338 INFO L273 TraceCheckUtils]: 11: Hoare triple {41737#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {41737#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,339 INFO L273 TraceCheckUtils]: 12: Hoare triple {41737#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {41737#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,339 INFO L273 TraceCheckUtils]: 13: Hoare triple {41737#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {41737#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,340 INFO L273 TraceCheckUtils]: 14: Hoare triple {41737#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {41750#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,341 INFO L273 TraceCheckUtils]: 15: Hoare triple {41750#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {41750#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,341 INFO L273 TraceCheckUtils]: 16: Hoare triple {41750#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {41750#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {41750#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {41750#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,342 INFO L273 TraceCheckUtils]: 18: Hoare triple {41750#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {41763#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {41763#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {41763#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,343 INFO L273 TraceCheckUtils]: 20: Hoare triple {41763#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {41763#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,344 INFO L273 TraceCheckUtils]: 21: Hoare triple {41763#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {41763#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,345 INFO L273 TraceCheckUtils]: 22: Hoare triple {41763#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {41776#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {41776#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {41776#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,346 INFO L273 TraceCheckUtils]: 24: Hoare triple {41776#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {41776#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {41776#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {41776#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,347 INFO L273 TraceCheckUtils]: 26: Hoare triple {41776#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {41776#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {41776#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {41776#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {41776#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {41795#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:39,349 INFO L273 TraceCheckUtils]: 29: Hoare triple {41795#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {41799#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:39,350 INFO L273 TraceCheckUtils]: 30: Hoare triple {41799#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {41702#false} is VALID [2018-11-18 22:29:39,350 INFO L273 TraceCheckUtils]: 31: Hoare triple {41702#false} assume !false; {41702#false} is VALID [2018-11-18 22:29:39,351 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-18 22:29:39,351 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:39,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:39,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 22:29:39,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-18 22:29:39,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:39,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:29:39,395 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-18 22:29:39,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:29:39,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:29:39,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:29:39,396 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 9 states. [2018-11-18 22:29:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:42,570 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2018-11-18 22:29:42,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:29:42,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-18 22:29:42,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2018-11-18 22:29:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2018-11-18 22:29:42,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 205 transitions. [2018-11-18 22:29:42,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:42,814 INFO L225 Difference]: With dead ends: 180 [2018-11-18 22:29:42,814 INFO L226 Difference]: Without dead ends: 178 [2018-11-18 22:29:42,814 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 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-18 22:29:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-18 22:29:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 160. [2018-11-18 22:29:42,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:42,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 160 states. [2018-11-18 22:29:42,871 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 160 states. [2018-11-18 22:29:42,871 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 160 states. [2018-11-18 22:29:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:42,874 INFO L93 Difference]: Finished difference Result 178 states and 203 transitions. [2018-11-18 22:29:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2018-11-18 22:29:42,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:42,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:42,874 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 178 states. [2018-11-18 22:29:42,874 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 178 states. [2018-11-18 22:29:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:42,877 INFO L93 Difference]: Finished difference Result 178 states and 203 transitions. [2018-11-18 22:29:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2018-11-18 22:29:42,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:42,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:42,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:42,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-18 22:29:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2018-11-18 22:29:42,879 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 32 [2018-11-18 22:29:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:42,879 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2018-11-18 22:29:42,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:29:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2018-11-18 22:29:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 22:29:42,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:42,880 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:29:42,880 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:42,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:42,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1410254304, now seen corresponding path program 1 times [2018-11-18 22:29:42,880 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:42,880 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:42,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:42,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:43,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {42538#true} call ULTIMATE.init(); {42538#true} is VALID [2018-11-18 22:29:43,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {42538#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {42538#true} is VALID [2018-11-18 22:29:43,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {42538#true} assume true; {42538#true} is VALID [2018-11-18 22:29:43,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42538#true} {42538#true} #388#return; {42538#true} is VALID [2018-11-18 22:29:43,081 INFO L256 TraceCheckUtils]: 4: Hoare triple {42538#true} call #t~ret15 := main(); {42538#true} is VALID [2018-11-18 22:29:43,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {42538#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {42538#true} is VALID [2018-11-18 22:29:43,082 INFO L273 TraceCheckUtils]: 6: Hoare triple {42538#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {42561#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,082 INFO L273 TraceCheckUtils]: 7: Hoare triple {42561#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {42561#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,082 INFO L273 TraceCheckUtils]: 8: Hoare triple {42561#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {42561#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,083 INFO L273 TraceCheckUtils]: 9: Hoare triple {42561#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {42561#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {42561#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42574#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {42574#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42574#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {42574#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {42574#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {42574#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {42574#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {42574#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42587#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {42587#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {42587#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {42587#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {42587#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,086 INFO L273 TraceCheckUtils]: 17: Hoare triple {42587#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {42587#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {42587#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42600#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {42600#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {42600#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,088 INFO L273 TraceCheckUtils]: 20: Hoare triple {42600#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {42600#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,089 INFO L273 TraceCheckUtils]: 21: Hoare triple {42600#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {42600#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,089 INFO L273 TraceCheckUtils]: 22: Hoare triple {42600#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42613#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {42613#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {42613#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {42613#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_29~0;~__tmp_29~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~28;~__VERIFIER_assert__cond~28 := ~__tmp_29~0; {42613#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,091 INFO L273 TraceCheckUtils]: 25: Hoare triple {42613#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~28);havoc ~__tmp_30~0;~__tmp_30~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~29;~__VERIFIER_assert__cond~29 := ~__tmp_30~0; {42613#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,092 INFO L273 TraceCheckUtils]: 26: Hoare triple {42613#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~29);~main____CPAchecker_TMP_2~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~4;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~4; {42626#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {42626#(= (_ bv5 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {42626#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,093 INFO L273 TraceCheckUtils]: 28: Hoare triple {42626#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {42626#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,093 INFO L273 TraceCheckUtils]: 29: Hoare triple {42626#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {42626#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:43,094 INFO L273 TraceCheckUtils]: 30: Hoare triple {42626#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {42639#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:43,094 INFO L273 TraceCheckUtils]: 31: Hoare triple {42639#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {42539#false} is VALID [2018-11-18 22:29:43,095 INFO L273 TraceCheckUtils]: 32: Hoare triple {42539#false} assume !false; {42539#false} is VALID [2018-11-18 22:29:43,096 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-18 22:29:43,096 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:43,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:43,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 22:29:43,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-18 22:29:43,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:43,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:29:43,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:43,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:29:43,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:29:43,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:29:43,138 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand 9 states. [2018-11-18 22:29:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:46,633 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2018-11-18 22:29:46,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:29:46,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-18 22:29:46,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 269 transitions. [2018-11-18 22:29:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 269 transitions. [2018-11-18 22:29:46,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 269 transitions. [2018-11-18 22:29:46,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:46,969 INFO L225 Difference]: With dead ends: 236 [2018-11-18 22:29:46,969 INFO L226 Difference]: Without dead ends: 234 [2018-11-18 22:29:46,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:29:46,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-18 22:29:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 163. [2018-11-18 22:29:47,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:47,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 163 states. [2018-11-18 22:29:47,017 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 163 states. [2018-11-18 22:29:47,017 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 163 states. [2018-11-18 22:29:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:47,022 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2018-11-18 22:29:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2018-11-18 22:29:47,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:47,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:47,022 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 234 states. [2018-11-18 22:29:47,023 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 234 states. [2018-11-18 22:29:47,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:47,027 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2018-11-18 22:29:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2018-11-18 22:29:47,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:47,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:47,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:47,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-18 22:29:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 189 transitions. [2018-11-18 22:29:47,029 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 189 transitions. Word has length 33 [2018-11-18 22:29:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:47,030 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 189 transitions. [2018-11-18 22:29:47,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:29:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 189 transitions. [2018-11-18 22:29:47,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 22:29:47,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:47,030 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:29:47,030 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:47,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:47,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1411793504, now seen corresponding path program 1 times [2018-11-18 22:29:47,031 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:47,031 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:47,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:47,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:47,227 INFO L256 TraceCheckUtils]: 0: Hoare triple {43566#true} call ULTIMATE.init(); {43566#true} is VALID [2018-11-18 22:29:47,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {43566#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {43566#true} is VALID [2018-11-18 22:29:47,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {43566#true} assume true; {43566#true} is VALID [2018-11-18 22:29:47,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43566#true} {43566#true} #388#return; {43566#true} is VALID [2018-11-18 22:29:47,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {43566#true} call #t~ret15 := main(); {43566#true} is VALID [2018-11-18 22:29:47,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {43566#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {43566#true} is VALID [2018-11-18 22:29:47,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {43566#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {43589#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {43589#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {43589#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {43589#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {43589#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {43589#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {43589#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {43589#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {43602#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {43602#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {43602#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,254 INFO L273 TraceCheckUtils]: 12: Hoare triple {43602#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {43602#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {43602#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {43602#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,256 INFO L273 TraceCheckUtils]: 14: Hoare triple {43602#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {43615#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {43615#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {43615#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,258 INFO L273 TraceCheckUtils]: 16: Hoare triple {43615#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {43615#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {43615#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {43615#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,260 INFO L273 TraceCheckUtils]: 18: Hoare triple {43615#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {43628#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,262 INFO L273 TraceCheckUtils]: 19: Hoare triple {43628#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {43628#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {43628#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {43628#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,264 INFO L273 TraceCheckUtils]: 21: Hoare triple {43628#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {43628#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,264 INFO L273 TraceCheckUtils]: 22: Hoare triple {43628#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {43641#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {43641#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {43641#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {43641#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_29~0;~__tmp_29~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~28;~__VERIFIER_assert__cond~28 := ~__tmp_29~0; {43641#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,268 INFO L273 TraceCheckUtils]: 25: Hoare triple {43641#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~28);havoc ~__tmp_30~0;~__tmp_30~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~29;~__VERIFIER_assert__cond~29 := ~__tmp_30~0; {43641#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {43641#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~29);~main____CPAchecker_TMP_2~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~4;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~4; {43654#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {43654#(= (_ bv5 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {43654#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {43654#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {43654#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,273 INFO L273 TraceCheckUtils]: 29: Hoare triple {43654#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {43654#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:47,273 INFO L273 TraceCheckUtils]: 30: Hoare triple {43654#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {43667#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:47,276 INFO L273 TraceCheckUtils]: 31: Hoare triple {43667#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~12; {43567#false} is VALID [2018-11-18 22:29:47,276 INFO L273 TraceCheckUtils]: 32: Hoare triple {43567#false} assume !false; {43567#false} is VALID [2018-11-18 22:29:47,277 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-18 22:29:47,277 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:47,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:47,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 22:29:47,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-18 22:29:47,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:47,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:29:47,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:47,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:29:47,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:29:47,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:29:47,333 INFO L87 Difference]: Start difference. First operand 163 states and 189 transitions. Second operand 9 states. [2018-11-18 22:29:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:50,904 INFO L93 Difference]: Finished difference Result 176 states and 201 transitions. [2018-11-18 22:29:50,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:29:50,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-18 22:29:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2018-11-18 22:29:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2018-11-18 22:29:50,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 201 transitions. [2018-11-18 22:29:51,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:51,147 INFO L225 Difference]: With dead ends: 176 [2018-11-18 22:29:51,148 INFO L226 Difference]: Without dead ends: 173 [2018-11-18 22:29:51,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 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-18 22:29:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-18 22:29:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2018-11-18 22:29:51,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:51,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 164 states. [2018-11-18 22:29:51,194 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 164 states. [2018-11-18 22:29:51,194 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 164 states. [2018-11-18 22:29:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:51,197 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2018-11-18 22:29:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2018-11-18 22:29:51,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:51,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:51,198 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 173 states. [2018-11-18 22:29:51,198 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 173 states. [2018-11-18 22:29:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:51,200 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2018-11-18 22:29:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2018-11-18 22:29:51,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:51,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:51,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:51,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-18 22:29:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 190 transitions. [2018-11-18 22:29:51,202 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 190 transitions. Word has length 33 [2018-11-18 22:29:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:51,203 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 190 transitions. [2018-11-18 22:29:51,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:29:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 190 transitions. [2018-11-18 22:29:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 22:29:51,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:51,203 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:29:51,203 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:51,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:51,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1264870345, now seen corresponding path program 1 times [2018-11-18 22:29:51,204 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:51,204 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 57 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:51,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:51,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:51,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {44396#true} call ULTIMATE.init(); {44396#true} is VALID [2018-11-18 22:29:51,410 INFO L273 TraceCheckUtils]: 1: Hoare triple {44396#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {44396#true} is VALID [2018-11-18 22:29:51,410 INFO L273 TraceCheckUtils]: 2: Hoare triple {44396#true} assume true; {44396#true} is VALID [2018-11-18 22:29:51,411 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44396#true} {44396#true} #388#return; {44396#true} is VALID [2018-11-18 22:29:51,411 INFO L256 TraceCheckUtils]: 4: Hoare triple {44396#true} call #t~ret15 := main(); {44396#true} is VALID [2018-11-18 22:29:51,411 INFO L273 TraceCheckUtils]: 5: Hoare triple {44396#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {44396#true} is VALID [2018-11-18 22:29:51,412 INFO L273 TraceCheckUtils]: 6: Hoare triple {44396#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {44419#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,412 INFO L273 TraceCheckUtils]: 7: Hoare triple {44419#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {44419#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,413 INFO L273 TraceCheckUtils]: 8: Hoare triple {44419#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {44419#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,413 INFO L273 TraceCheckUtils]: 9: Hoare triple {44419#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {44419#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,414 INFO L273 TraceCheckUtils]: 10: Hoare triple {44419#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44432#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,414 INFO L273 TraceCheckUtils]: 11: Hoare triple {44432#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {44432#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,414 INFO L273 TraceCheckUtils]: 12: Hoare triple {44432#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {44432#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,415 INFO L273 TraceCheckUtils]: 13: Hoare triple {44432#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {44432#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,415 INFO L273 TraceCheckUtils]: 14: Hoare triple {44432#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44445#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,416 INFO L273 TraceCheckUtils]: 15: Hoare triple {44445#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {44445#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,416 INFO L273 TraceCheckUtils]: 16: Hoare triple {44445#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {44445#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {44445#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {44445#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,417 INFO L273 TraceCheckUtils]: 18: Hoare triple {44445#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44458#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,417 INFO L273 TraceCheckUtils]: 19: Hoare triple {44458#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {44458#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,418 INFO L273 TraceCheckUtils]: 20: Hoare triple {44458#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {44458#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,418 INFO L273 TraceCheckUtils]: 21: Hoare triple {44458#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {44458#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {44458#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {44471#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,420 INFO L273 TraceCheckUtils]: 23: Hoare triple {44471#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {44471#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,420 INFO L273 TraceCheckUtils]: 24: Hoare triple {44471#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {44471#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,421 INFO L273 TraceCheckUtils]: 25: Hoare triple {44471#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {44471#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,421 INFO L273 TraceCheckUtils]: 26: Hoare triple {44471#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {44471#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,422 INFO L273 TraceCheckUtils]: 27: Hoare triple {44471#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {44471#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,422 INFO L273 TraceCheckUtils]: 28: Hoare triple {44471#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44490#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,423 INFO L273 TraceCheckUtils]: 29: Hoare triple {44490#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {44490#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:51,424 INFO L273 TraceCheckUtils]: 30: Hoare triple {44490#(= (_ bv5 32) main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {44497#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:51,424 INFO L273 TraceCheckUtils]: 31: Hoare triple {44497#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {44397#false} is VALID [2018-11-18 22:29:51,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {44397#false} assume !false; {44397#false} is VALID [2018-11-18 22:29:51,426 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-18 22:29:51,426 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:51,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:51,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 22:29:51,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-18 22:29:51,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:51,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:29:51,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:51,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:29:51,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:29:51,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:29:51,485 INFO L87 Difference]: Start difference. First operand 164 states and 190 transitions. Second operand 9 states. [2018-11-18 22:29:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:55,488 INFO L93 Difference]: Finished difference Result 238 states and 273 transitions. [2018-11-18 22:29:55,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:29:55,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-18 22:29:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 273 transitions. [2018-11-18 22:29:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:29:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 273 transitions. [2018-11-18 22:29:55,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 273 transitions. [2018-11-18 22:29:55,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:55,837 INFO L225 Difference]: With dead ends: 238 [2018-11-18 22:29:55,837 INFO L226 Difference]: Without dead ends: 236 [2018-11-18 22:29:55,837 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:29:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-18 22:29:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 166. [2018-11-18 22:29:55,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:55,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand 166 states. [2018-11-18 22:29:55,887 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 166 states. [2018-11-18 22:29:55,888 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 166 states. [2018-11-18 22:29:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:55,892 INFO L93 Difference]: Finished difference Result 236 states and 271 transitions. [2018-11-18 22:29:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 271 transitions. [2018-11-18 22:29:55,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:55,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:55,892 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 236 states. [2018-11-18 22:29:55,892 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 236 states. [2018-11-18 22:29:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:55,895 INFO L93 Difference]: Finished difference Result 236 states and 271 transitions. [2018-11-18 22:29:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 271 transitions. [2018-11-18 22:29:55,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:55,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:55,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:55,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-18 22:29:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 192 transitions. [2018-11-18 22:29:55,898 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 192 transitions. Word has length 33 [2018-11-18 22:29:55,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:55,898 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 192 transitions. [2018-11-18 22:29:55,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:29:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2018-11-18 22:29:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 22:29:55,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:55,898 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:29:55,899 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:55,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:55,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1265297349, now seen corresponding path program 1 times [2018-11-18 22:29:55,899 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:55,899 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:29:55,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:56,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:56,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {45435#true} call ULTIMATE.init(); {45435#true} is VALID [2018-11-18 22:29:56,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {45435#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {45435#true} is VALID [2018-11-18 22:29:56,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {45435#true} assume true; {45435#true} is VALID [2018-11-18 22:29:56,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45435#true} {45435#true} #388#return; {45435#true} is VALID [2018-11-18 22:29:56,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {45435#true} call #t~ret15 := main(); {45435#true} is VALID [2018-11-18 22:29:56,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {45435#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {45435#true} is VALID [2018-11-18 22:29:56,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {45435#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {45458#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {45458#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {45458#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {45458#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {45458#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,113 INFO L273 TraceCheckUtils]: 9: Hoare triple {45458#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {45458#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {45458#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {45471#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {45471#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {45471#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {45471#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {45471#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {45471#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {45471#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {45471#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {45484#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {45484#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {45484#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {45484#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {45484#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,117 INFO L273 TraceCheckUtils]: 17: Hoare triple {45484#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {45484#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {45484#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {45497#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {45497#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {45497#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {45497#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_25~0;~__tmp_25~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~24;~__VERIFIER_assert__cond~24 := ~__tmp_25~0; {45497#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {45497#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~24);havoc ~__tmp_26~0;~__tmp_26~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~25;~__VERIFIER_assert__cond~25 := ~__tmp_26~0; {45497#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,120 INFO L273 TraceCheckUtils]: 22: Hoare triple {45497#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~25);~main____CPAchecker_TMP_2~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~3;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~3; {45510#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {45510#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {45510#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,121 INFO L273 TraceCheckUtils]: 24: Hoare triple {45510#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {45510#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,121 INFO L273 TraceCheckUtils]: 25: Hoare triple {45510#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {45510#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,122 INFO L273 TraceCheckUtils]: 26: Hoare triple {45510#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {45510#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,122 INFO L273 TraceCheckUtils]: 27: Hoare triple {45510#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {45510#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {45510#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {45529#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:29:56,124 INFO L273 TraceCheckUtils]: 29: Hoare triple {45529#(= (_ bv5 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {45533#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-18 22:29:56,125 INFO L273 TraceCheckUtils]: 30: Hoare triple {45533#(and (= (_ bv5 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {45537#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:56,126 INFO L273 TraceCheckUtils]: 31: Hoare triple {45537#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {45436#false} is VALID [2018-11-18 22:29:56,126 INFO L273 TraceCheckUtils]: 32: Hoare triple {45436#false} assume !false; {45436#false} is VALID [2018-11-18 22:29:56,127 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-18 22:29:56,128 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:56,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:56,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 22:29:56,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-18 22:29:56,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:56,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:29:56,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:56,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:29:56,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:29:56,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:29:56,173 INFO L87 Difference]: Start difference. First operand 166 states and 192 transitions. Second operand 10 states. [2018-11-18 22:29:59,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:59,503 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2018-11-18 22:29:59,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:29:59,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-18 22:29:59,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:29:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2018-11-18 22:29:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:29:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2018-11-18 22:29:59,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 196 transitions. [2018-11-18 22:29:59,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:59,741 INFO L225 Difference]: With dead ends: 171 [2018-11-18 22:29:59,741 INFO L226 Difference]: Without dead ends: 167 [2018-11-18 22:29:59,741 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 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-18 22:29:59,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-18 22:30:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-11-18 22:30:00,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:30:00,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 165 states. [2018-11-18 22:30:00,142 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 165 states. [2018-11-18 22:30:00,142 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 165 states. [2018-11-18 22:30:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:30:00,145 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2018-11-18 22:30:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2018-11-18 22:30:00,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:30:00,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:30:00,146 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 167 states. [2018-11-18 22:30:00,146 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 167 states. [2018-11-18 22:30:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:30:00,148 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2018-11-18 22:30:00,148 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2018-11-18 22:30:00,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:30:00,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:30:00,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:30:00,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:30:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-18 22:30:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2018-11-18 22:30:00,151 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 33 [2018-11-18 22:30:00,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:30:00,151 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2018-11-18 22:30:00,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:30:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2018-11-18 22:30:00,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 22:30:00,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:30:00,151 INFO L375 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-18 22:30:00,152 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:30:00,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:30:00,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1825167237, now seen corresponding path program 1 times [2018-11-18 22:30:00,152 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:30:00,152 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 59 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:30:00,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:30:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:30:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:30:00,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:30:00,369 INFO L256 TraceCheckUtils]: 0: Hoare triple {46251#true} call ULTIMATE.init(); {46251#true} is VALID [2018-11-18 22:30:00,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {46251#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {46251#true} is VALID [2018-11-18 22:30:00,370 INFO L273 TraceCheckUtils]: 2: Hoare triple {46251#true} assume true; {46251#true} is VALID [2018-11-18 22:30:00,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46251#true} {46251#true} #388#return; {46251#true} is VALID [2018-11-18 22:30:00,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {46251#true} call #t~ret15 := main(); {46251#true} is VALID [2018-11-18 22:30:00,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {46251#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {46251#true} is VALID [2018-11-18 22:30:00,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {46251#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {46274#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {46274#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {46274#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {46274#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {46274#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {46274#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {46274#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {46274#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46287#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {46287#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {46287#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {46287#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {46287#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,420 INFO L273 TraceCheckUtils]: 13: Hoare triple {46287#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {46287#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,421 INFO L273 TraceCheckUtils]: 14: Hoare triple {46287#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46300#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {46300#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {46300#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {46300#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {46300#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,422 INFO L273 TraceCheckUtils]: 17: Hoare triple {46300#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {46300#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {46300#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46313#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {46313#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {46313#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {46313#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {46313#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {46313#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {46313#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {46313#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46326#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,425 INFO L273 TraceCheckUtils]: 23: Hoare triple {46326#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {46326#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {46326#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_31~0;~__tmp_31~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {46326#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,426 INFO L273 TraceCheckUtils]: 25: Hoare triple {46326#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~30);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {46326#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,427 INFO L273 TraceCheckUtils]: 26: Hoare triple {46326#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~31);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46339#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,427 INFO L273 TraceCheckUtils]: 27: Hoare triple {46339#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet10;havoc #t~nondet10; {46339#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,428 INFO L273 TraceCheckUtils]: 28: Hoare triple {46339#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_35~0;~__tmp_35~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {46339#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,428 INFO L273 TraceCheckUtils]: 29: Hoare triple {46339#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {46339#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,429 INFO L273 TraceCheckUtils]: 30: Hoare triple {46339#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46352#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,440 INFO L273 TraceCheckUtils]: 31: Hoare triple {46352#(= (_ bv6 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {46352#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-18 22:30:00,440 INFO L273 TraceCheckUtils]: 32: Hoare triple {46352#(= (_ bv6 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {46359#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:30:00,441 INFO L273 TraceCheckUtils]: 33: Hoare triple {46359#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {46252#false} is VALID [2018-11-18 22:30:00,441 INFO L273 TraceCheckUtils]: 34: Hoare triple {46252#false} assume !false; {46252#false} is VALID [2018-11-18 22:30:00,442 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-18 22:30:00,442 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:30:00,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:30:00,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 22:30:00,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-18 22:30:00,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:30:00,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:30:00,490 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-18 22:30:00,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:30:00,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:30:00,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:30:00,491 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand 10 states. [2018-11-18 22:30:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:30:04,400 INFO L93 Difference]: Finished difference Result 204 states and 230 transitions. [2018-11-18 22:30:04,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:30:04,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-18 22:30:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:30:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:30:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 230 transitions. [2018-11-18 22:30:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:30:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 230 transitions. [2018-11-18 22:30:04,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 230 transitions. [2018-11-18 22:30:04,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:30:04,681 INFO L225 Difference]: With dead ends: 204 [2018-11-18 22:30:04,681 INFO L226 Difference]: Without dead ends: 202 [2018-11-18 22:30:04,681 INFO L604 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-18 22:30:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-18 22:30:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 167. [2018-11-18 22:30:04,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:30:04,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 167 states. [2018-11-18 22:30:04,750 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 167 states. [2018-11-18 22:30:04,750 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 167 states. [2018-11-18 22:30:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:30:04,754 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2018-11-18 22:30:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 228 transitions. [2018-11-18 22:30:04,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:30:04,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:30:04,754 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 202 states. [2018-11-18 22:30:04,755 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 202 states. [2018-11-18 22:30:04,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:30:04,757 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2018-11-18 22:30:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 228 transitions. [2018-11-18 22:30:04,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:30:04,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:30:04,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:30:04,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:30:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-18 22:30:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 192 transitions. [2018-11-18 22:30:04,761 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 192 transitions. Word has length 35 [2018-11-18 22:30:04,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:30:04,761 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 192 transitions. [2018-11-18 22:30:04,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:30:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2018-11-18 22:30:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 22:30:04,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:30:04,762 INFO L375 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-18 22:30:04,762 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:30:04,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:30:04,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1237717152, now seen corresponding path program 1 times [2018-11-18 22:30:04,763 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:30:04,763 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 60 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 60 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:30:04,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:30:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:30:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:30:04,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:30:04,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {47182#true} call ULTIMATE.init(); {47182#true} is VALID [2018-11-18 22:30:04,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {47182#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {47182#true} is VALID [2018-11-18 22:30:04,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {47182#true} assume true; {47182#true} is VALID [2018-11-18 22:30:04,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47182#true} {47182#true} #388#return; {47182#true} is VALID [2018-11-18 22:30:04,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {47182#true} call #t~ret15 := main(); {47182#true} is VALID [2018-11-18 22:30:04,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {47182#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {47182#true} is VALID [2018-11-18 22:30:04,983 INFO L273 TraceCheckUtils]: 6: Hoare triple {47182#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {47205#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,983 INFO L273 TraceCheckUtils]: 7: Hoare triple {47205#(= (_ 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; {47205#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {47205#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {47205#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {47205#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {47205#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,984 INFO L273 TraceCheckUtils]: 10: Hoare triple {47205#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47218#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {47218#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {47218#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {47218#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {47218#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,985 INFO L273 TraceCheckUtils]: 13: Hoare triple {47218#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {47218#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {47218#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47231#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {47231#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {47231#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {47231#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {47231#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {47231#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {47231#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,987 INFO L273 TraceCheckUtils]: 18: Hoare triple {47231#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47244#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {47244#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;~main____CPAchecker_TMP_0~3 := #t~nondet8;havoc #t~nondet8; {47244#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {47244#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {47244#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {47244#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {47244#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {47244#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47257#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,990 INFO L273 TraceCheckUtils]: 23: Hoare triple {47257#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;~main____CPAchecker_TMP_0~4 := #t~nondet9;havoc #t~nondet9; {47257#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {47257#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_31~0;~__tmp_31~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {47257#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,991 INFO L273 TraceCheckUtils]: 25: Hoare triple {47257#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~30);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {47257#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,992 INFO L273 TraceCheckUtils]: 26: Hoare triple {47257#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~31);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47270#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,992 INFO L273 TraceCheckUtils]: 27: Hoare triple {47270#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;~main____CPAchecker_TMP_0~5 := #t~nondet10;havoc #t~nondet10; {47270#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,993 INFO L273 TraceCheckUtils]: 28: Hoare triple {47270#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_33~0;~__tmp_33~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~32;~__VERIFIER_assert__cond~32 := ~__tmp_33~0; {47270#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,993 INFO L273 TraceCheckUtils]: 29: Hoare triple {47270#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~32);havoc ~__tmp_34~0;~__tmp_34~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~33;~__VERIFIER_assert__cond~33 := ~__tmp_34~0; {47270#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,994 INFO L273 TraceCheckUtils]: 30: Hoare triple {47270#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~33);~main____CPAchecker_TMP_2~5 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~5;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~5; {47283#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {47283#(= (_ bv6 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {47283#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-18 22:30:04,995 INFO L273 TraceCheckUtils]: 32: Hoare triple {47283#(= (_ bv6 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {47290#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:30:04,996 INFO L273 TraceCheckUtils]: 33: Hoare triple {47290#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {47183#false} is VALID [2018-11-18 22:30:04,996 INFO L273 TraceCheckUtils]: 34: Hoare triple {47183#false} assume !false; {47183#false} is VALID [2018-11-18 22:30:04,998 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-18 22:30:04,998 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:30:04,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:30:05,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 22:30:05,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-18 22:30:05,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:30:05,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:30:05,043 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-18 22:30:05,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:30:05,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:30:05,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:30:05,045 INFO L87 Difference]: Start difference. First operand 167 states and 192 transitions. Second operand 10 states.