/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-267fbe0
[2020-07-18 00:48:28,533 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-07-18 00:48:28,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-18 00:48:28,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-18 00:48:28,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-18 00:48:28,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-18 00:48:28,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-18 00:48:28,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-18 00:48:28,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-18 00:48:28,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-18 00:48:28,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-07-18 00:48:28,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-18 00:48:28,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-18 00:48:28,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-18 00:48:28,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-18 00:48:28,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-18 00:48:28,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-18 00:48:28,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-18 00:48:28,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-18 00:48:28,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-18 00:48:28,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-18 00:48:28,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-18 00:48:28,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-07-18 00:48:28,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-18 00:48:28,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-18 00:48:28,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-18 00:48:28,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-18 00:48:28,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-18 00:48:28,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-18 00:48:28,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-18 00:48:28,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-18 00:48:28,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-18 00:48:28,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-18 00:48:28,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-18 00:48:28,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-18 00:48:28,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-18 00:48:28,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-18 00:48:28,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-18 00:48:28,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-18 00:48:28,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-18 00:48:28,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-07-18 00:48:28,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf
[2020-07-18 00:48:28,634 INFO L113 SettingsManager]: Loading preferences was successful
[2020-07-18 00:48:28,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-18 00:48:28,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-18 00:48:28,636 INFO L138 SettingsManager]: * sizeof long=4
[2020-07-18 00:48:28,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-07-18 00:48:28,637 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-07-18 00:48:28,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-07-18 00:48:28,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-07-18 00:48:28,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-18 00:48:28,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-07-18 00:48:28,639 INFO L138 SettingsManager]: * sizeof long double=12
[2020-07-18 00:48:28,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-07-18 00:48:28,639 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-07-18 00:48:28,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-07-18 00:48:28,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-18 00:48:28,642 INFO L138 SettingsManager]: * Size of a code block=SingleStatement
[2020-07-18 00:48:28,642 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-07-18 00:48:28,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-07-18 00:48:28,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-18 00:48:28,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-18 00:48:28,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation
[2020-07-18 00:48:28,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-18 00:48:28,643 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
[2020-07-18 00:48:28,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-18 00:48:28,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-18 00:48:28,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-18 00:48:28,952 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-07-18 00:48:28,953 INFO L275 PluginConnector]: CDTParser initialized
[2020-07-18 00:48:28,953 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i
[2020-07-18 00:48:29,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19ce220b/882a7368292b4534ba3089f1a327f3ff/FLAG4e480a8ad
[2020-07-18 00:48:29,500 INFO L306 CDTParser]: Found 1 translation units.
[2020-07-18 00:48:29,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i
[2020-07-18 00:48:29,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19ce220b/882a7368292b4534ba3089f1a327f3ff/FLAG4e480a8ad
[2020-07-18 00:48:29,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19ce220b/882a7368292b4534ba3089f1a327f3ff
[2020-07-18 00:48:29,882 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-18 00:48:29,885 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-18 00:48:29,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-18 00:48:29,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-18 00:48:29,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-18 00:48:29,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:29" (1/1) ...
[2020-07-18 00:48:29,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b778e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:29, skipping insertion in model container
[2020-07-18 00:48:29,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:29" (1/1) ...
[2020-07-18 00:48:29,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-07-18 00:48:29,920 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-07-18 00:48:30,083 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-18 00:48:30,089 INFO L203 MainTranslator]: Completed pre-run
[2020-07-18 00:48:30,113 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-18 00:48:30,130 INFO L208 MainTranslator]: Completed translation
[2020-07-18 00:48:30,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:30 WrapperNode
[2020-07-18 00:48:30,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-18 00:48:30,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-18 00:48:30,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-18 00:48:30,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-07-18 00:48:30,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:30" (1/1) ...
[2020-07-18 00:48:30,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:30" (1/1) ...
[2020-07-18 00:48:30,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:30" (1/1) ...
[2020-07-18 00:48:30,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:30" (1/1) ...
[2020-07-18 00:48:30,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:30" (1/1) ...
[2020-07-18 00:48:30,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:30" (1/1) ...
[2020-07-18 00:48:30,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:30" (1/1) ...
[2020-07-18 00:48:30,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-18 00:48:30,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-18 00:48:30,175 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-07-18 00:48:30,176 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-07-18 00:48:30,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:30" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-18 00:48:30,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-18 00:48:30,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-18 00:48:30,330 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2020-07-18 00:48:30,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2020-07-18 00:48:30,330 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2020-07-18 00:48:30,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-18 00:48:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2020-07-18 00:48:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2020-07-18 00:48:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2020-07-18 00:48:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-18 00:48:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2020-07-18 00:48:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-18 00:48:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-18 00:48:30,929 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-18 00:48:30,929 INFO L295 CfgBuilder]: Removed 2 assume(true) statements.
[2020-07-18 00:48:30,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:30 BoogieIcfgContainer
[2020-07-18 00:48:30,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-18 00:48:30,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-18 00:48:30,937 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-07-18 00:48:30,940 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-07-18 00:48:30,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:48:29" (1/3) ...
[2020-07-18 00:48:30,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378643d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:30, skipping insertion in model container
[2020-07-18 00:48:30,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:30" (2/3) ...
[2020-07-18 00:48:30,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378643d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:30, skipping insertion in model container
[2020-07-18 00:48:30,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:30" (3/3) ...
[2020-07-18 00:48:30,944 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i
[2020-07-18 00:48:30,954 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-07-18 00:48:30,961 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-18 00:48:30,971 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-18 00:48:30,993 INFO L375 AbstractCegarLoop]: Interprodecural is true
[2020-07-18 00:48:30,994 INFO L376 AbstractCegarLoop]: Hoare is true
[2020-07-18 00:48:30,994 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation
[2020-07-18 00:48:30,994 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-18 00:48:30,994 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-18 00:48:30,994 INFO L380 AbstractCegarLoop]: Difference is false
[2020-07-18 00:48:30,995 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-18 00:48:30,995 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-18 00:48:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states.
[2020-07-18 00:48:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-07-18 00:48:31,022 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:31,023 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:31,024 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:31,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:31,029 INFO L82 PathProgramCache]: Analyzing trace with hash -537390573, now seen corresponding path program 1 times
[2020-07-18 00:48:31,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:31,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [299164938]
[2020-07-18 00:48:31,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:31,209 INFO L280 TraceCheckUtils]: 0: Hoare triple {77#true} assume true; {77#true} is VALID
[2020-07-18 00:48:31,209 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {77#true} {77#true} #144#return; {77#true} is VALID
[2020-07-18 00:48:31,212 INFO L263 TraceCheckUtils]: 0: Hoare triple {77#true} call ULTIMATE.init(); {77#true} is VALID
[2020-07-18 00:48:31,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#true} assume true; {77#true} is VALID
[2020-07-18 00:48:31,213 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {77#true} {77#true} #144#return; {77#true} is VALID
[2020-07-18 00:48:31,213 INFO L263 TraceCheckUtils]: 3: Hoare triple {77#true} call #t~ret10 := main(); {77#true} is VALID
[2020-07-18 00:48:31,214 INFO L280 TraceCheckUtils]: 4: Hoare triple {77#true} havoc ~tagbuf_len~0; {77#true} is VALID
[2020-07-18 00:48:31,214 INFO L280 TraceCheckUtils]: 5: Hoare triple {77#true} havoc ~t~0; {77#true} is VALID
[2020-07-18 00:48:31,215 INFO L280 TraceCheckUtils]: 6: Hoare triple {77#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {77#true} is VALID
[2020-07-18 00:48:31,215 INFO L280 TraceCheckUtils]: 7: Hoare triple {77#true} ~tagbuf_len~0 := #t~nondet0; {77#true} is VALID
[2020-07-18 00:48:31,216 INFO L280 TraceCheckUtils]: 8: Hoare triple {77#true} havoc #t~nondet0; {77#true} is VALID
[2020-07-18 00:48:31,216 INFO L280 TraceCheckUtils]: 9: Hoare triple {77#true} assume ~tagbuf_len~0 >= 1; {77#true} is VALID
[2020-07-18 00:48:31,217 INFO L280 TraceCheckUtils]: 10: Hoare triple {77#true} ~t~0 := 0; {77#true} is VALID
[2020-07-18 00:48:31,217 INFO L280 TraceCheckUtils]: 11: Hoare triple {77#true} #t~pre1 := ~tagbuf_len~0 - 1; {77#true} is VALID
[2020-07-18 00:48:31,217 INFO L280 TraceCheckUtils]: 12: Hoare triple {77#true} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {77#true} is VALID
[2020-07-18 00:48:31,218 INFO L280 TraceCheckUtils]: 13: Hoare triple {77#true} havoc #t~pre1; {77#true} is VALID
[2020-07-18 00:48:31,219 INFO L280 TraceCheckUtils]: 14: Hoare triple {77#true} assume false; {78#false} is VALID
[2020-07-18 00:48:31,220 INFO L263 TraceCheckUtils]: 15: Hoare triple {78#false} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {78#false} is VALID
[2020-07-18 00:48:31,220 INFO L280 TraceCheckUtils]: 16: Hoare triple {78#false} ~cond := #in~cond; {78#false} is VALID
[2020-07-18 00:48:31,221 INFO L280 TraceCheckUtils]: 17: Hoare triple {78#false} assume 0 == ~cond; {78#false} is VALID
[2020-07-18 00:48:31,221 INFO L280 TraceCheckUtils]: 18: Hoare triple {78#false} assume !false; {78#false} is VALID
[2020-07-18 00:48:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:31,226 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:31,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [299164938]
[2020-07-18 00:48:31,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:31,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-07-18 00:48:31,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142539708]
[2020-07-18 00:48:31,240 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19
[2020-07-18 00:48:31,243 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:31,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states.
[2020-07-18 00:48:31,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:31,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states
[2020-07-18 00:48:31,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:31,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2020-07-18 00:48:31,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2020-07-18 00:48:31,296 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states.
[2020-07-18 00:48:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:31,553 INFO L93 Difference]: Finished difference Result 134 states and 203 transitions.
[2020-07-18 00:48:31,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2020-07-18 00:48:31,553 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19
[2020-07-18 00:48:31,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2020-07-18 00:48:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions.
[2020-07-18 00:48:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2020-07-18 00:48:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions.
[2020-07-18 00:48:31,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 203 transitions.
[2020-07-18 00:48:31,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:32,004 INFO L225 Difference]: With dead ends: 134
[2020-07-18 00:48:32,004 INFO L226 Difference]: Without dead ends: 69
[2020-07-18 00:48:32,022 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2020-07-18 00:48:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2020-07-18 00:48:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69.
[2020-07-18 00:48:32,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:32,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 69 states.
[2020-07-18 00:48:32,112 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states.
[2020-07-18 00:48:32,113 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states.
[2020-07-18 00:48:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:32,121 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions.
[2020-07-18 00:48:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions.
[2020-07-18 00:48:32,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:32,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:32,124 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states.
[2020-07-18 00:48:32,124 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states.
[2020-07-18 00:48:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:32,132 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions.
[2020-07-18 00:48:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions.
[2020-07-18 00:48:32,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:32,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:32,135 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:32,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states.
[2020-07-18 00:48:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions.
[2020-07-18 00:48:32,143 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 19
[2020-07-18 00:48:32,144 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:32,144 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions.
[2020-07-18 00:48:32,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2020-07-18 00:48:32,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 87 transitions.
[2020-07-18 00:48:32,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions.
[2020-07-18 00:48:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-07-18 00:48:32,249 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:32,249 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:32,249 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-18 00:48:32,249 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:32,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:32,250 INFO L82 PathProgramCache]: Analyzing trace with hash 471335344, now seen corresponding path program 1 times
[2020-07-18 00:48:32,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:32,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1173517649]
[2020-07-18 00:48:32,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:32,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {627#true} assume true; {627#true} is VALID
[2020-07-18 00:48:32,364 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {627#true} {627#true} #144#return; {627#true} is VALID
[2020-07-18 00:48:32,364 INFO L263 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID
[2020-07-18 00:48:32,364 INFO L280 TraceCheckUtils]: 1: Hoare triple {627#true} assume true; {627#true} is VALID
[2020-07-18 00:48:32,365 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {627#true} {627#true} #144#return; {627#true} is VALID
[2020-07-18 00:48:32,365 INFO L263 TraceCheckUtils]: 3: Hoare triple {627#true} call #t~ret10 := main(); {627#true} is VALID
[2020-07-18 00:48:32,365 INFO L280 TraceCheckUtils]: 4: Hoare triple {627#true} havoc ~tagbuf_len~0; {627#true} is VALID
[2020-07-18 00:48:32,366 INFO L280 TraceCheckUtils]: 5: Hoare triple {627#true} havoc ~t~0; {627#true} is VALID
[2020-07-18 00:48:32,366 INFO L280 TraceCheckUtils]: 6: Hoare triple {627#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {627#true} is VALID
[2020-07-18 00:48:32,366 INFO L280 TraceCheckUtils]: 7: Hoare triple {627#true} ~tagbuf_len~0 := #t~nondet0; {627#true} is VALID
[2020-07-18 00:48:32,367 INFO L280 TraceCheckUtils]: 8: Hoare triple {627#true} havoc #t~nondet0; {627#true} is VALID
[2020-07-18 00:48:32,367 INFO L280 TraceCheckUtils]: 9: Hoare triple {627#true} assume ~tagbuf_len~0 >= 1; {627#true} is VALID
[2020-07-18 00:48:32,368 INFO L280 TraceCheckUtils]: 10: Hoare triple {627#true} ~t~0 := 0; {631#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:32,369 INFO L280 TraceCheckUtils]: 11: Hoare triple {631#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {631#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:32,370 INFO L280 TraceCheckUtils]: 12: Hoare triple {631#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {631#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:32,371 INFO L280 TraceCheckUtils]: 13: Hoare triple {631#(<= 0 main_~t~0)} havoc #t~pre1; {631#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:32,372 INFO L280 TraceCheckUtils]: 14: Hoare triple {631#(<= 0 main_~t~0)} assume !false; {631#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:32,372 INFO L280 TraceCheckUtils]: 15: Hoare triple {631#(<= 0 main_~t~0)} assume ~t~0 == ~tagbuf_len~0; {631#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:32,374 INFO L263 TraceCheckUtils]: 16: Hoare triple {631#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {632#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:32,375 INFO L280 TraceCheckUtils]: 17: Hoare triple {632#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {633#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:32,375 INFO L280 TraceCheckUtils]: 18: Hoare triple {633#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {628#false} is VALID
[2020-07-18 00:48:32,376 INFO L280 TraceCheckUtils]: 19: Hoare triple {628#false} assume !false; {628#false} is VALID
[2020-07-18 00:48:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:32,379 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:32,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1173517649]
[2020-07-18 00:48:32,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:32,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-07-18 00:48:32,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241698931]
[2020-07-18 00:48:32,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20
[2020-07-18 00:48:32,381 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:32,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states.
[2020-07-18 00:48:32,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:32,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-07-18 00:48:32,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-07-18 00:48:32,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-07-18 00:48:32,405 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand 5 states.
[2020-07-18 00:48:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:32,963 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions.
[2020-07-18 00:48:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-07-18 00:48:32,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20
[2020-07-18 00:48:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-18 00:48:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions.
[2020-07-18 00:48:32,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-18 00:48:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions.
[2020-07-18 00:48:32,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 115 transitions.
[2020-07-18 00:48:33,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:33,114 INFO L225 Difference]: With dead ends: 91
[2020-07-18 00:48:33,115 INFO L226 Difference]: Without dead ends: 89
[2020-07-18 00:48:33,116 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-07-18 00:48:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2020-07-18 00:48:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82.
[2020-07-18 00:48:33,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:33,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 82 states.
[2020-07-18 00:48:33,176 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 82 states.
[2020-07-18 00:48:33,176 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 82 states.
[2020-07-18 00:48:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:33,183 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions.
[2020-07-18 00:48:33,183 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions.
[2020-07-18 00:48:33,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:33,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:33,186 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 89 states.
[2020-07-18 00:48:33,186 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 89 states.
[2020-07-18 00:48:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:33,192 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions.
[2020-07-18 00:48:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions.
[2020-07-18 00:48:33,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:33,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:33,194 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:33,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states.
[2020-07-18 00:48:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions.
[2020-07-18 00:48:33,200 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 20
[2020-07-18 00:48:33,200 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:33,201 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions.
[2020-07-18 00:48:33,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-07-18 00:48:33,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states and 104 transitions.
[2020-07-18 00:48:33,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions.
[2020-07-18 00:48:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2020-07-18 00:48:33,312 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:33,312 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:33,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-18 00:48:33,313 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1383579147, now seen corresponding path program 1 times
[2020-07-18 00:48:33,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:33,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [674543422]
[2020-07-18 00:48:33,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:33,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {1162#true} assume true; {1162#true} is VALID
[2020-07-18 00:48:33,399 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1162#true} {1162#true} #144#return; {1162#true} is VALID
[2020-07-18 00:48:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:33,421 INFO L280 TraceCheckUtils]: 0: Hoare triple {1162#true} ~cond := #in~cond; {1162#true} is VALID
[2020-07-18 00:48:33,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} assume !(0 == ~cond); {1162#true} is VALID
[2020-07-18 00:48:33,421 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID
[2020-07-18 00:48:33,425 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1166#(<= main_~t~0 main_~tagbuf_len~0)} #148#return; {1166#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:33,425 INFO L263 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1162#true} is VALID
[2020-07-18 00:48:33,426 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} assume true; {1162#true} is VALID
[2020-07-18 00:48:33,426 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1162#true} {1162#true} #144#return; {1162#true} is VALID
[2020-07-18 00:48:33,426 INFO L263 TraceCheckUtils]: 3: Hoare triple {1162#true} call #t~ret10 := main(); {1162#true} is VALID
[2020-07-18 00:48:33,426 INFO L280 TraceCheckUtils]: 4: Hoare triple {1162#true} havoc ~tagbuf_len~0; {1162#true} is VALID
[2020-07-18 00:48:33,426 INFO L280 TraceCheckUtils]: 5: Hoare triple {1162#true} havoc ~t~0; {1162#true} is VALID
[2020-07-18 00:48:33,427 INFO L280 TraceCheckUtils]: 6: Hoare triple {1162#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1162#true} is VALID
[2020-07-18 00:48:33,427 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} ~tagbuf_len~0 := #t~nondet0; {1162#true} is VALID
[2020-07-18 00:48:33,427 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} havoc #t~nondet0; {1162#true} is VALID
[2020-07-18 00:48:33,427 INFO L280 TraceCheckUtils]: 9: Hoare triple {1162#true} assume ~tagbuf_len~0 >= 1; {1162#true} is VALID
[2020-07-18 00:48:33,428 INFO L280 TraceCheckUtils]: 10: Hoare triple {1162#true} ~t~0 := 0; {1162#true} is VALID
[2020-07-18 00:48:33,428 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} #t~pre1 := ~tagbuf_len~0 - 1; {1162#true} is VALID
[2020-07-18 00:48:33,428 INFO L280 TraceCheckUtils]: 12: Hoare triple {1162#true} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {1162#true} is VALID
[2020-07-18 00:48:33,428 INFO L280 TraceCheckUtils]: 13: Hoare triple {1162#true} havoc #t~pre1; {1162#true} is VALID
[2020-07-18 00:48:33,429 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} assume !false; {1162#true} is VALID
[2020-07-18 00:48:33,429 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} assume ~t~0 == ~tagbuf_len~0; {1166#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:33,430 INFO L263 TraceCheckUtils]: 16: Hoare triple {1166#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1162#true} is VALID
[2020-07-18 00:48:33,430 INFO L280 TraceCheckUtils]: 17: Hoare triple {1162#true} ~cond := #in~cond; {1162#true} is VALID
[2020-07-18 00:48:33,430 INFO L280 TraceCheckUtils]: 18: Hoare triple {1162#true} assume !(0 == ~cond); {1162#true} is VALID
[2020-07-18 00:48:33,431 INFO L280 TraceCheckUtils]: 19: Hoare triple {1162#true} assume true; {1162#true} is VALID
[2020-07-18 00:48:33,432 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1162#true} {1166#(<= main_~t~0 main_~tagbuf_len~0)} #148#return; {1166#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:33,433 INFO L263 TraceCheckUtils]: 21: Hoare triple {1166#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1171#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:33,433 INFO L280 TraceCheckUtils]: 22: Hoare triple {1171#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1172#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:33,434 INFO L280 TraceCheckUtils]: 23: Hoare triple {1172#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1163#false} is VALID
[2020-07-18 00:48:33,434 INFO L280 TraceCheckUtils]: 24: Hoare triple {1163#false} assume !false; {1163#false} is VALID
[2020-07-18 00:48:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:33,435 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:33,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [674543422]
[2020-07-18 00:48:33,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:33,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-07-18 00:48:33,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416095175]
[2020-07-18 00:48:33,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25
[2020-07-18 00:48:33,437 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:33,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states.
[2020-07-18 00:48:33,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:33,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-07-18 00:48:33,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:33,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-07-18 00:48:33,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-07-18 00:48:33,465 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand 5 states.
[2020-07-18 00:48:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:33,848 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions.
[2020-07-18 00:48:33,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-07-18 00:48:33,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25
[2020-07-18 00:48:33,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-18 00:48:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions.
[2020-07-18 00:48:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-18 00:48:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions.
[2020-07-18 00:48:33,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 92 transitions.
[2020-07-18 00:48:33,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:33,957 INFO L225 Difference]: With dead ends: 88
[2020-07-18 00:48:33,957 INFO L226 Difference]: Without dead ends: 78
[2020-07-18 00:48:33,958 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-07-18 00:48:33,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2020-07-18 00:48:34,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78.
[2020-07-18 00:48:34,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:34,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states.
[2020-07-18 00:48:34,012 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states.
[2020-07-18 00:48:34,012 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states.
[2020-07-18 00:48:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:34,019 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions.
[2020-07-18 00:48:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions.
[2020-07-18 00:48:34,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:34,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:34,021 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states.
[2020-07-18 00:48:34,021 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states.
[2020-07-18 00:48:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:34,028 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions.
[2020-07-18 00:48:34,029 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions.
[2020-07-18 00:48:34,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:34,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:34,030 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:34,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states.
[2020-07-18 00:48:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions.
[2020-07-18 00:48:34,037 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 25
[2020-07-18 00:48:34,038 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:34,038 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions.
[2020-07-18 00:48:34,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-07-18 00:48:34,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 95 transitions.
[2020-07-18 00:48:34,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions.
[2020-07-18 00:48:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2020-07-18 00:48:34,141 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:34,141 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:34,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-07-18 00:48:34,142 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:34,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:34,142 INFO L82 PathProgramCache]: Analyzing trace with hash 344115466, now seen corresponding path program 1 times
[2020-07-18 00:48:34,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:34,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [883662053]
[2020-07-18 00:48:34,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:34,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {1665#true} assume true; {1665#true} is VALID
[2020-07-18 00:48:34,250 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1665#true} {1665#true} #144#return; {1665#true} is VALID
[2020-07-18 00:48:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:34,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID
[2020-07-18 00:48:34,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} assume !(0 == ~cond); {1665#true} is VALID
[2020-07-18 00:48:34,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {1665#true} assume true; {1665#true} is VALID
[2020-07-18 00:48:34,262 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1671#(<= main_~t~0 main_~tagbuf_len~0)} #152#return; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:34,262 INFO L263 TraceCheckUtils]: 0: Hoare triple {1665#true} call ULTIMATE.init(); {1665#true} is VALID
[2020-07-18 00:48:34,262 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID
[2020-07-18 00:48:34,263 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} #144#return; {1665#true} is VALID
[2020-07-18 00:48:34,263 INFO L263 TraceCheckUtils]: 3: Hoare triple {1665#true} call #t~ret10 := main(); {1665#true} is VALID
[2020-07-18 00:48:34,263 INFO L280 TraceCheckUtils]: 4: Hoare triple {1665#true} havoc ~tagbuf_len~0; {1665#true} is VALID
[2020-07-18 00:48:34,263 INFO L280 TraceCheckUtils]: 5: Hoare triple {1665#true} havoc ~t~0; {1665#true} is VALID
[2020-07-18 00:48:34,264 INFO L280 TraceCheckUtils]: 6: Hoare triple {1665#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1665#true} is VALID
[2020-07-18 00:48:34,264 INFO L280 TraceCheckUtils]: 7: Hoare triple {1665#true} ~tagbuf_len~0 := #t~nondet0; {1665#true} is VALID
[2020-07-18 00:48:34,264 INFO L280 TraceCheckUtils]: 8: Hoare triple {1665#true} havoc #t~nondet0; {1665#true} is VALID
[2020-07-18 00:48:34,265 INFO L280 TraceCheckUtils]: 9: Hoare triple {1665#true} assume ~tagbuf_len~0 >= 1; {1669#(<= 1 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:34,266 INFO L280 TraceCheckUtils]: 10: Hoare triple {1669#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {1670#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:34,266 INFO L280 TraceCheckUtils]: 11: Hoare triple {1670#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {1670#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:34,267 INFO L280 TraceCheckUtils]: 12: Hoare triple {1670#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:34,268 INFO L280 TraceCheckUtils]: 13: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:34,269 INFO L280 TraceCheckUtils]: 14: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:34,269 INFO L280 TraceCheckUtils]: 15: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:34,270 INFO L280 TraceCheckUtils]: 16: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:34,271 INFO L280 TraceCheckUtils]: 17: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:34,271 INFO L280 TraceCheckUtils]: 18: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet2; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:34,272 INFO L263 TraceCheckUtils]: 19: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1665#true} is VALID
[2020-07-18 00:48:34,272 INFO L280 TraceCheckUtils]: 20: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID
[2020-07-18 00:48:34,272 INFO L280 TraceCheckUtils]: 21: Hoare triple {1665#true} assume !(0 == ~cond); {1665#true} is VALID
[2020-07-18 00:48:34,272 INFO L280 TraceCheckUtils]: 22: Hoare triple {1665#true} assume true; {1665#true} is VALID
[2020-07-18 00:48:34,273 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1665#true} {1671#(<= main_~t~0 main_~tagbuf_len~0)} #152#return; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:34,274 INFO L263 TraceCheckUtils]: 24: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1676#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:34,275 INFO L280 TraceCheckUtils]: 25: Hoare triple {1676#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1677#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:34,275 INFO L280 TraceCheckUtils]: 26: Hoare triple {1677#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1666#false} is VALID
[2020-07-18 00:48:34,276 INFO L280 TraceCheckUtils]: 27: Hoare triple {1666#false} assume !false; {1666#false} is VALID
[2020-07-18 00:48:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:34,277 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:34,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [883662053]
[2020-07-18 00:48:34,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:34,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-07-18 00:48:34,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061260463]
[2020-07-18 00:48:34,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28
[2020-07-18 00:48:34,279 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:34,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states.
[2020-07-18 00:48:34,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:34,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-07-18 00:48:34,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:34,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-07-18 00:48:34,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-07-18 00:48:34,319 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand 7 states.
[2020-07-18 00:48:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:34,919 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions.
[2020-07-18 00:48:34,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2020-07-18 00:48:34,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28
[2020-07-18 00:48:34,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:34,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 00:48:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions.
[2020-07-18 00:48:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 00:48:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions.
[2020-07-18 00:48:34,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 105 transitions.
[2020-07-18 00:48:35,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:35,038 INFO L225 Difference]: With dead ends: 90
[2020-07-18 00:48:35,038 INFO L226 Difference]: Without dead ends: 88
[2020-07-18 00:48:35,039 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2020-07-18 00:48:35,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2020-07-18 00:48:35,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84.
[2020-07-18 00:48:35,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:35,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 84 states.
[2020-07-18 00:48:35,105 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 84 states.
[2020-07-18 00:48:35,105 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 84 states.
[2020-07-18 00:48:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:35,112 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions.
[2020-07-18 00:48:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions.
[2020-07-18 00:48:35,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:35,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:35,113 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 88 states.
[2020-07-18 00:48:35,113 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 88 states.
[2020-07-18 00:48:35,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:35,120 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions.
[2020-07-18 00:48:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions.
[2020-07-18 00:48:35,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:35,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:35,121 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:35,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states.
[2020-07-18 00:48:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions.
[2020-07-18 00:48:35,127 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 28
[2020-07-18 00:48:35,127 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:35,127 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions.
[2020-07-18 00:48:35,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-07-18 00:48:35,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 102 transitions.
[2020-07-18 00:48:35,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions.
[2020-07-18 00:48:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2020-07-18 00:48:35,263 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:35,264 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:35,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-07-18 00:48:35,264 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:35,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:35,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1469174755, now seen corresponding path program 1 times
[2020-07-18 00:48:35,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:35,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2054824485]
[2020-07-18 00:48:35,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:35,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {2208#true} assume true; {2208#true} is VALID
[2020-07-18 00:48:35,451 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2208#true} {2208#true} #144#return; {2208#true} is VALID
[2020-07-18 00:48:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:35,466 INFO L280 TraceCheckUtils]: 0: Hoare triple {2208#true} ~cond := #in~cond; {2208#true} is VALID
[2020-07-18 00:48:35,466 INFO L280 TraceCheckUtils]: 1: Hoare triple {2208#true} assume !(0 == ~cond); {2208#true} is VALID
[2020-07-18 00:48:35,467 INFO L280 TraceCheckUtils]: 2: Hoare triple {2208#true} assume true; {2208#true} is VALID
[2020-07-18 00:48:35,468 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2208#true} {2213#(<= 0 main_~tagbuf_len~0)} #152#return; {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:35,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {2208#true} ~cond := #in~cond; {2208#true} is VALID
[2020-07-18 00:48:35,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {2208#true} assume !(0 == ~cond); {2208#true} is VALID
[2020-07-18 00:48:35,477 INFO L280 TraceCheckUtils]: 2: Hoare triple {2208#true} assume true; {2208#true} is VALID
[2020-07-18 00:48:35,478 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2208#true} {2213#(<= 0 main_~tagbuf_len~0)} #154#return; {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,479 INFO L263 TraceCheckUtils]: 0: Hoare triple {2208#true} call ULTIMATE.init(); {2208#true} is VALID
[2020-07-18 00:48:35,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {2208#true} assume true; {2208#true} is VALID
[2020-07-18 00:48:35,479 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2208#true} {2208#true} #144#return; {2208#true} is VALID
[2020-07-18 00:48:35,479 INFO L263 TraceCheckUtils]: 3: Hoare triple {2208#true} call #t~ret10 := main(); {2208#true} is VALID
[2020-07-18 00:48:35,480 INFO L280 TraceCheckUtils]: 4: Hoare triple {2208#true} havoc ~tagbuf_len~0; {2208#true} is VALID
[2020-07-18 00:48:35,480 INFO L280 TraceCheckUtils]: 5: Hoare triple {2208#true} havoc ~t~0; {2208#true} is VALID
[2020-07-18 00:48:35,480 INFO L280 TraceCheckUtils]: 6: Hoare triple {2208#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2208#true} is VALID
[2020-07-18 00:48:35,481 INFO L280 TraceCheckUtils]: 7: Hoare triple {2208#true} ~tagbuf_len~0 := #t~nondet0; {2208#true} is VALID
[2020-07-18 00:48:35,481 INFO L280 TraceCheckUtils]: 8: Hoare triple {2208#true} havoc #t~nondet0; {2208#true} is VALID
[2020-07-18 00:48:35,482 INFO L280 TraceCheckUtils]: 9: Hoare triple {2208#true} assume ~tagbuf_len~0 >= 1; {2212#(<= 1 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,482 INFO L280 TraceCheckUtils]: 10: Hoare triple {2212#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {2212#(<= 1 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,483 INFO L280 TraceCheckUtils]: 11: Hoare triple {2212#(<= 1 main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {2212#(<= 1 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,484 INFO L280 TraceCheckUtils]: 12: Hoare triple {2212#(<= 1 main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,484 INFO L280 TraceCheckUtils]: 13: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} havoc #t~pre1; {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,485 INFO L280 TraceCheckUtils]: 14: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume !false; {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,485 INFO L280 TraceCheckUtils]: 15: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,486 INFO L280 TraceCheckUtils]: 16: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,487 INFO L280 TraceCheckUtils]: 17: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,487 INFO L280 TraceCheckUtils]: 18: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} havoc #t~nondet2; {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,488 INFO L263 TraceCheckUtils]: 19: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2208#true} is VALID
[2020-07-18 00:48:35,488 INFO L280 TraceCheckUtils]: 20: Hoare triple {2208#true} ~cond := #in~cond; {2208#true} is VALID
[2020-07-18 00:48:35,488 INFO L280 TraceCheckUtils]: 21: Hoare triple {2208#true} assume !(0 == ~cond); {2208#true} is VALID
[2020-07-18 00:48:35,488 INFO L280 TraceCheckUtils]: 22: Hoare triple {2208#true} assume true; {2208#true} is VALID
[2020-07-18 00:48:35,489 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2208#true} {2213#(<= 0 main_~tagbuf_len~0)} #152#return; {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,490 INFO L263 TraceCheckUtils]: 24: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2208#true} is VALID
[2020-07-18 00:48:35,490 INFO L280 TraceCheckUtils]: 25: Hoare triple {2208#true} ~cond := #in~cond; {2208#true} is VALID
[2020-07-18 00:48:35,490 INFO L280 TraceCheckUtils]: 26: Hoare triple {2208#true} assume !(0 == ~cond); {2208#true} is VALID
[2020-07-18 00:48:35,490 INFO L280 TraceCheckUtils]: 27: Hoare triple {2208#true} assume true; {2208#true} is VALID
[2020-07-18 00:48:35,491 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2208#true} {2213#(<= 0 main_~tagbuf_len~0)} #154#return; {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,493 INFO L280 TraceCheckUtils]: 29: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} #t~post3 := ~t~0; {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,494 INFO L280 TraceCheckUtils]: 30: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,495 INFO L280 TraceCheckUtils]: 31: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} havoc #t~post3; {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,496 INFO L280 TraceCheckUtils]: 32: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume !false; {2213#(<= 0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:35,498 INFO L280 TraceCheckUtils]: 33: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume ~t~0 == ~tagbuf_len~0; {2222#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:35,499 INFO L263 TraceCheckUtils]: 34: Hoare triple {2222#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2223#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:35,500 INFO L280 TraceCheckUtils]: 35: Hoare triple {2223#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2224#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:35,500 INFO L280 TraceCheckUtils]: 36: Hoare triple {2224#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2209#false} is VALID
[2020-07-18 00:48:35,501 INFO L280 TraceCheckUtils]: 37: Hoare triple {2209#false} assume !false; {2209#false} is VALID
[2020-07-18 00:48:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:35,503 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:35,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2054824485]
[2020-07-18 00:48:35,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:35,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-07-18 00:48:35,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995887304]
[2020-07-18 00:48:35,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38
[2020-07-18 00:48:35,505 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:35,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states.
[2020-07-18 00:48:35,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:35,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-07-18 00:48:35,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:35,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-07-18 00:48:35,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-07-18 00:48:35,539 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 7 states.
[2020-07-18 00:48:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:36,142 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions.
[2020-07-18 00:48:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2020-07-18 00:48:36,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38
[2020-07-18 00:48:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 00:48:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions.
[2020-07-18 00:48:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 00:48:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions.
[2020-07-18 00:48:36,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 105 transitions.
[2020-07-18 00:48:36,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:36,275 INFO L225 Difference]: With dead ends: 94
[2020-07-18 00:48:36,279 INFO L226 Difference]: Without dead ends: 85
[2020-07-18 00:48:36,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2020-07-18 00:48:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2020-07-18 00:48:36,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81.
[2020-07-18 00:48:36,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:36,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 81 states.
[2020-07-18 00:48:36,370 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 81 states.
[2020-07-18 00:48:36,370 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 81 states.
[2020-07-18 00:48:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:36,375 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions.
[2020-07-18 00:48:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions.
[2020-07-18 00:48:36,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:36,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:36,376 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 85 states.
[2020-07-18 00:48:36,376 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 85 states.
[2020-07-18 00:48:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:36,380 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions.
[2020-07-18 00:48:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions.
[2020-07-18 00:48:36,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:36,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:36,382 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:36,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2020-07-18 00:48:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions.
[2020-07-18 00:48:36,385 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 38
[2020-07-18 00:48:36,386 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:36,386 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions.
[2020-07-18 00:48:36,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-07-18 00:48:36,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 96 transitions.
[2020-07-18 00:48:36,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions.
[2020-07-18 00:48:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2020-07-18 00:48:36,507 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:36,508 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:36,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-07-18 00:48:36,508 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:36,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:36,508 INFO L82 PathProgramCache]: Analyzing trace with hash 859677550, now seen corresponding path program 1 times
[2020-07-18 00:48:36,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:36,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592108234]
[2020-07-18 00:48:36,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:36,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {2753#true} assume true; {2753#true} is VALID
[2020-07-18 00:48:36,598 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2753#true} {2753#true} #144#return; {2753#true} is VALID
[2020-07-18 00:48:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:36,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {2753#true} ~cond := #in~cond; {2753#true} is VALID
[2020-07-18 00:48:36,610 INFO L280 TraceCheckUtils]: 1: Hoare triple {2753#true} assume !(0 == ~cond); {2753#true} is VALID
[2020-07-18 00:48:36,610 INFO L280 TraceCheckUtils]: 2: Hoare triple {2753#true} assume true; {2753#true} is VALID
[2020-07-18 00:48:36,611 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2753#true} {2757#(<= 0 main_~t~0)} #152#return; {2757#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:36,617 INFO L280 TraceCheckUtils]: 0: Hoare triple {2753#true} ~cond := #in~cond; {2753#true} is VALID
[2020-07-18 00:48:36,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {2753#true} assume !(0 == ~cond); {2753#true} is VALID
[2020-07-18 00:48:36,618 INFO L280 TraceCheckUtils]: 2: Hoare triple {2753#true} assume true; {2753#true} is VALID
[2020-07-18 00:48:36,618 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2753#true} {2757#(<= 0 main_~t~0)} #154#return; {2757#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:36,619 INFO L263 TraceCheckUtils]: 0: Hoare triple {2753#true} call ULTIMATE.init(); {2753#true} is VALID
[2020-07-18 00:48:36,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {2753#true} assume true; {2753#true} is VALID
[2020-07-18 00:48:36,619 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2753#true} {2753#true} #144#return; {2753#true} is VALID
[2020-07-18 00:48:36,619 INFO L263 TraceCheckUtils]: 3: Hoare triple {2753#true} call #t~ret10 := main(); {2753#true} is VALID
[2020-07-18 00:48:36,620 INFO L280 TraceCheckUtils]: 4: Hoare triple {2753#true} havoc ~tagbuf_len~0; {2753#true} is VALID
[2020-07-18 00:48:36,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {2753#true} havoc ~t~0; {2753#true} is VALID
[2020-07-18 00:48:36,620 INFO L280 TraceCheckUtils]: 6: Hoare triple {2753#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2753#true} is VALID
[2020-07-18 00:48:36,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {2753#true} ~tagbuf_len~0 := #t~nondet0; {2753#true} is VALID
[2020-07-18 00:48:36,621 INFO L280 TraceCheckUtils]: 8: Hoare triple {2753#true} havoc #t~nondet0; {2753#true} is VALID
[2020-07-18 00:48:36,621 INFO L280 TraceCheckUtils]: 9: Hoare triple {2753#true} assume ~tagbuf_len~0 >= 1; {2753#true} is VALID
[2020-07-18 00:48:36,622 INFO L280 TraceCheckUtils]: 10: Hoare triple {2753#true} ~t~0 := 0; {2757#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:36,622 INFO L280 TraceCheckUtils]: 11: Hoare triple {2757#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {2757#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:36,623 INFO L280 TraceCheckUtils]: 12: Hoare triple {2757#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {2757#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:36,623 INFO L280 TraceCheckUtils]: 13: Hoare triple {2757#(<= 0 main_~t~0)} havoc #t~pre1; {2757#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:36,624 INFO L280 TraceCheckUtils]: 14: Hoare triple {2757#(<= 0 main_~t~0)} assume !false; {2757#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:36,624 INFO L280 TraceCheckUtils]: 15: Hoare triple {2757#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {2757#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:36,625 INFO L280 TraceCheckUtils]: 16: Hoare triple {2757#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2757#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:36,625 INFO L280 TraceCheckUtils]: 17: Hoare triple {2757#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {2757#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:36,626 INFO L280 TraceCheckUtils]: 18: Hoare triple {2757#(<= 0 main_~t~0)} havoc #t~nondet2; {2757#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:36,626 INFO L263 TraceCheckUtils]: 19: Hoare triple {2757#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2753#true} is VALID
[2020-07-18 00:48:36,627 INFO L280 TraceCheckUtils]: 20: Hoare triple {2753#true} ~cond := #in~cond; {2753#true} is VALID
[2020-07-18 00:48:36,627 INFO L280 TraceCheckUtils]: 21: Hoare triple {2753#true} assume !(0 == ~cond); {2753#true} is VALID
[2020-07-18 00:48:36,627 INFO L280 TraceCheckUtils]: 22: Hoare triple {2753#true} assume true; {2753#true} is VALID
[2020-07-18 00:48:36,628 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2753#true} {2757#(<= 0 main_~t~0)} #152#return; {2757#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:36,628 INFO L263 TraceCheckUtils]: 24: Hoare triple {2757#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2753#true} is VALID
[2020-07-18 00:48:36,628 INFO L280 TraceCheckUtils]: 25: Hoare triple {2753#true} ~cond := #in~cond; {2753#true} is VALID
[2020-07-18 00:48:36,629 INFO L280 TraceCheckUtils]: 26: Hoare triple {2753#true} assume !(0 == ~cond); {2753#true} is VALID
[2020-07-18 00:48:36,629 INFO L280 TraceCheckUtils]: 27: Hoare triple {2753#true} assume true; {2753#true} is VALID
[2020-07-18 00:48:36,630 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2753#true} {2757#(<= 0 main_~t~0)} #154#return; {2757#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:36,630 INFO L280 TraceCheckUtils]: 29: Hoare triple {2757#(<= 0 main_~t~0)} #t~post3 := ~t~0; {2766#(<= 0 |main_#t~post3|)} is VALID
[2020-07-18 00:48:36,631 INFO L280 TraceCheckUtils]: 30: Hoare triple {2766#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {2767#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:36,632 INFO L280 TraceCheckUtils]: 31: Hoare triple {2767#(<= 1 main_~t~0)} havoc #t~post3; {2767#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:36,632 INFO L280 TraceCheckUtils]: 32: Hoare triple {2767#(<= 1 main_~t~0)} assume !false; {2767#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:36,633 INFO L280 TraceCheckUtils]: 33: Hoare triple {2767#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {2767#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:36,633 INFO L280 TraceCheckUtils]: 34: Hoare triple {2767#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2767#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:36,634 INFO L280 TraceCheckUtils]: 35: Hoare triple {2767#(<= 1 main_~t~0)} assume !(0 != #t~nondet2); {2767#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:36,634 INFO L280 TraceCheckUtils]: 36: Hoare triple {2767#(<= 1 main_~t~0)} havoc #t~nondet2; {2767#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:36,635 INFO L263 TraceCheckUtils]: 37: Hoare triple {2767#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2768#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:36,636 INFO L280 TraceCheckUtils]: 38: Hoare triple {2768#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2769#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:36,636 INFO L280 TraceCheckUtils]: 39: Hoare triple {2769#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2754#false} is VALID
[2020-07-18 00:48:36,637 INFO L280 TraceCheckUtils]: 40: Hoare triple {2754#false} assume !false; {2754#false} is VALID
[2020-07-18 00:48:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:36,639 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:36,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592108234]
[2020-07-18 00:48:36,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:36,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-07-18 00:48:36,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095535292]
[2020-07-18 00:48:36,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41
[2020-07-18 00:48:36,641 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:36,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states.
[2020-07-18 00:48:36,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:36,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-07-18 00:48:36,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:36,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-07-18 00:48:36,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-07-18 00:48:36,679 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand 7 states.
[2020-07-18 00:48:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:37,226 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions.
[2020-07-18 00:48:37,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2020-07-18 00:48:37,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41
[2020-07-18 00:48:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 00:48:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions.
[2020-07-18 00:48:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 00:48:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions.
[2020-07-18 00:48:37,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 99 transitions.
[2020-07-18 00:48:37,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:37,327 INFO L225 Difference]: With dead ends: 91
[2020-07-18 00:48:37,328 INFO L226 Difference]: Without dead ends: 89
[2020-07-18 00:48:37,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2020-07-18 00:48:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2020-07-18 00:48:37,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85.
[2020-07-18 00:48:37,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:37,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 85 states.
[2020-07-18 00:48:37,417 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 85 states.
[2020-07-18 00:48:37,417 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 85 states.
[2020-07-18 00:48:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:37,422 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions.
[2020-07-18 00:48:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions.
[2020-07-18 00:48:37,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:37,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:37,423 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 89 states.
[2020-07-18 00:48:37,423 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 89 states.
[2020-07-18 00:48:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:37,427 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions.
[2020-07-18 00:48:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions.
[2020-07-18 00:48:37,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:37,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:37,428 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:37,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states.
[2020-07-18 00:48:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions.
[2020-07-18 00:48:37,432 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 41
[2020-07-18 00:48:37,432 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:37,433 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions.
[2020-07-18 00:48:37,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-07-18 00:48:37,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 99 transitions.
[2020-07-18 00:48:37,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions.
[2020-07-18 00:48:37,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2020-07-18 00:48:37,555 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:37,555 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:37,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-07-18 00:48:37,556 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:37,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:37,556 INFO L82 PathProgramCache]: Analyzing trace with hash -943144682, now seen corresponding path program 1 times
[2020-07-18 00:48:37,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:37,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [842985119]
[2020-07-18 00:48:37,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:37,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {3308#true} assume true; {3308#true} is VALID
[2020-07-18 00:48:37,657 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3308#true} {3308#true} #144#return; {3308#true} is VALID
[2020-07-18 00:48:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:37,665 INFO L280 TraceCheckUtils]: 0: Hoare triple {3308#true} ~cond := #in~cond; {3308#true} is VALID
[2020-07-18 00:48:37,665 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#true} assume !(0 == ~cond); {3308#true} is VALID
[2020-07-18 00:48:37,665 INFO L280 TraceCheckUtils]: 2: Hoare triple {3308#true} assume true; {3308#true} is VALID
[2020-07-18 00:48:37,666 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3308#true} {3312#(<= 0 main_~t~0)} #156#return; {3312#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:37,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {3308#true} ~cond := #in~cond; {3308#true} is VALID
[2020-07-18 00:48:37,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#true} assume !(0 == ~cond); {3308#true} is VALID
[2020-07-18 00:48:37,675 INFO L280 TraceCheckUtils]: 2: Hoare triple {3308#true} assume true; {3308#true} is VALID
[2020-07-18 00:48:37,676 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3308#true} {3312#(<= 0 main_~t~0)} #158#return; {3312#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:37,676 INFO L263 TraceCheckUtils]: 0: Hoare triple {3308#true} call ULTIMATE.init(); {3308#true} is VALID
[2020-07-18 00:48:37,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#true} assume true; {3308#true} is VALID
[2020-07-18 00:48:37,676 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3308#true} {3308#true} #144#return; {3308#true} is VALID
[2020-07-18 00:48:37,676 INFO L263 TraceCheckUtils]: 3: Hoare triple {3308#true} call #t~ret10 := main(); {3308#true} is VALID
[2020-07-18 00:48:37,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {3308#true} havoc ~tagbuf_len~0; {3308#true} is VALID
[2020-07-18 00:48:37,677 INFO L280 TraceCheckUtils]: 5: Hoare triple {3308#true} havoc ~t~0; {3308#true} is VALID
[2020-07-18 00:48:37,677 INFO L280 TraceCheckUtils]: 6: Hoare triple {3308#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3308#true} is VALID
[2020-07-18 00:48:37,677 INFO L280 TraceCheckUtils]: 7: Hoare triple {3308#true} ~tagbuf_len~0 := #t~nondet0; {3308#true} is VALID
[2020-07-18 00:48:37,678 INFO L280 TraceCheckUtils]: 8: Hoare triple {3308#true} havoc #t~nondet0; {3308#true} is VALID
[2020-07-18 00:48:37,678 INFO L280 TraceCheckUtils]: 9: Hoare triple {3308#true} assume ~tagbuf_len~0 >= 1; {3308#true} is VALID
[2020-07-18 00:48:37,684 INFO L280 TraceCheckUtils]: 10: Hoare triple {3308#true} ~t~0 := 0; {3312#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:37,687 INFO L280 TraceCheckUtils]: 11: Hoare triple {3312#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {3312#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:37,689 INFO L280 TraceCheckUtils]: 12: Hoare triple {3312#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {3312#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:37,692 INFO L280 TraceCheckUtils]: 13: Hoare triple {3312#(<= 0 main_~t~0)} havoc #t~pre1; {3312#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:37,695 INFO L280 TraceCheckUtils]: 14: Hoare triple {3312#(<= 0 main_~t~0)} assume !false; {3312#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:37,695 INFO L280 TraceCheckUtils]: 15: Hoare triple {3312#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {3312#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:37,696 INFO L280 TraceCheckUtils]: 16: Hoare triple {3312#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3312#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:37,696 INFO L280 TraceCheckUtils]: 17: Hoare triple {3312#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {3312#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:37,697 INFO L280 TraceCheckUtils]: 18: Hoare triple {3312#(<= 0 main_~t~0)} havoc #t~nondet2; {3312#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:37,697 INFO L263 TraceCheckUtils]: 19: Hoare triple {3312#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {3308#true} is VALID
[2020-07-18 00:48:37,697 INFO L280 TraceCheckUtils]: 20: Hoare triple {3308#true} ~cond := #in~cond; {3308#true} is VALID
[2020-07-18 00:48:37,698 INFO L280 TraceCheckUtils]: 21: Hoare triple {3308#true} assume !(0 == ~cond); {3308#true} is VALID
[2020-07-18 00:48:37,698 INFO L280 TraceCheckUtils]: 22: Hoare triple {3308#true} assume true; {3308#true} is VALID
[2020-07-18 00:48:37,699 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {3308#true} {3312#(<= 0 main_~t~0)} #156#return; {3312#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:37,699 INFO L263 TraceCheckUtils]: 24: Hoare triple {3312#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {3308#true} is VALID
[2020-07-18 00:48:37,699 INFO L280 TraceCheckUtils]: 25: Hoare triple {3308#true} ~cond := #in~cond; {3308#true} is VALID
[2020-07-18 00:48:37,700 INFO L280 TraceCheckUtils]: 26: Hoare triple {3308#true} assume !(0 == ~cond); {3308#true} is VALID
[2020-07-18 00:48:37,700 INFO L280 TraceCheckUtils]: 27: Hoare triple {3308#true} assume true; {3308#true} is VALID
[2020-07-18 00:48:37,701 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3308#true} {3312#(<= 0 main_~t~0)} #158#return; {3312#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:37,701 INFO L280 TraceCheckUtils]: 29: Hoare triple {3312#(<= 0 main_~t~0)} #t~post4 := ~t~0; {3321#(<= 0 |main_#t~post4|)} is VALID
[2020-07-18 00:48:37,702 INFO L280 TraceCheckUtils]: 30: Hoare triple {3321#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {3322#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:37,703 INFO L280 TraceCheckUtils]: 31: Hoare triple {3322#(<= 1 main_~t~0)} havoc #t~post4; {3322#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:37,704 INFO L280 TraceCheckUtils]: 32: Hoare triple {3322#(<= 1 main_~t~0)} assume !false; {3322#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:37,705 INFO L280 TraceCheckUtils]: 33: Hoare triple {3322#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {3322#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:37,705 INFO L280 TraceCheckUtils]: 34: Hoare triple {3322#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3322#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:37,713 INFO L280 TraceCheckUtils]: 35: Hoare triple {3322#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {3322#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:37,714 INFO L280 TraceCheckUtils]: 36: Hoare triple {3322#(<= 1 main_~t~0)} havoc #t~nondet5; {3322#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:37,717 INFO L280 TraceCheckUtils]: 37: Hoare triple {3322#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3322#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:37,722 INFO L280 TraceCheckUtils]: 38: Hoare triple {3322#(<= 1 main_~t~0)} assume !(0 != #t~nondet6); {3322#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:37,727 INFO L280 TraceCheckUtils]: 39: Hoare triple {3322#(<= 1 main_~t~0)} havoc #t~nondet6; {3322#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:37,728 INFO L263 TraceCheckUtils]: 40: Hoare triple {3322#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {3323#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:37,729 INFO L280 TraceCheckUtils]: 41: Hoare triple {3323#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3324#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:37,730 INFO L280 TraceCheckUtils]: 42: Hoare triple {3324#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3309#false} is VALID
[2020-07-18 00:48:37,730 INFO L280 TraceCheckUtils]: 43: Hoare triple {3309#false} assume !false; {3309#false} is VALID
[2020-07-18 00:48:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:37,732 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:37,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [842985119]
[2020-07-18 00:48:37,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:37,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-07-18 00:48:37,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975899514]
[2020-07-18 00:48:37,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44
[2020-07-18 00:48:37,735 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:37,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states.
[2020-07-18 00:48:37,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:37,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-07-18 00:48:37,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:37,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-07-18 00:48:37,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-07-18 00:48:37,772 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 7 states.
[2020-07-18 00:48:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:38,379 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions.
[2020-07-18 00:48:38,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2020-07-18 00:48:38,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44
[2020-07-18 00:48:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 00:48:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions.
[2020-07-18 00:48:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 00:48:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions.
[2020-07-18 00:48:38,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 132 transitions.
[2020-07-18 00:48:38,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:38,538 INFO L225 Difference]: With dead ends: 120
[2020-07-18 00:48:38,538 INFO L226 Difference]: Without dead ends: 118
[2020-07-18 00:48:38,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2020-07-18 00:48:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2020-07-18 00:48:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109.
[2020-07-18 00:48:38,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:38,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 109 states.
[2020-07-18 00:48:38,681 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 109 states.
[2020-07-18 00:48:38,681 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 109 states.
[2020-07-18 00:48:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:38,686 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions.
[2020-07-18 00:48:38,686 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions.
[2020-07-18 00:48:38,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:38,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:38,687 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 118 states.
[2020-07-18 00:48:38,687 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 118 states.
[2020-07-18 00:48:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:38,692 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions.
[2020-07-18 00:48:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions.
[2020-07-18 00:48:38,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:38,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:38,693 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:38,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states.
[2020-07-18 00:48:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions.
[2020-07-18 00:48:38,697 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 44
[2020-07-18 00:48:38,697 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:38,697 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions.
[2020-07-18 00:48:38,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-07-18 00:48:38,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 109 states and 128 transitions.
[2020-07-18 00:48:38,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions.
[2020-07-18 00:48:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2020-07-18 00:48:38,862 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:38,863 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:38,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-07-18 00:48:38,863 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:38,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:38,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1177695863, now seen corresponding path program 2 times
[2020-07-18 00:48:38,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:38,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [140696303]
[2020-07-18 00:48:38,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:38,995 INFO L280 TraceCheckUtils]: 0: Hoare triple {4027#true} assume true; {4027#true} is VALID
[2020-07-18 00:48:38,996 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4027#true} {4027#true} #144#return; {4027#true} is VALID
[2020-07-18 00:48:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:39,005 INFO L280 TraceCheckUtils]: 0: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID
[2020-07-18 00:48:39,006 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID
[2020-07-18 00:48:39,006 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#true} assume true; {4027#true} is VALID
[2020-07-18 00:48:39,006 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4027#true} {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:39,021 INFO L280 TraceCheckUtils]: 0: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID
[2020-07-18 00:48:39,022 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID
[2020-07-18 00:48:39,022 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#true} assume true; {4027#true} is VALID
[2020-07-18 00:48:39,023 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4027#true} {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:39,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID
[2020-07-18 00:48:39,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID
[2020-07-18 00:48:39,033 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#true} assume true; {4027#true} is VALID
[2020-07-18 00:48:39,034 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4027#true} {4033#(<= main_~t~0 main_~tagbuf_len~0)} #152#return; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,035 INFO L263 TraceCheckUtils]: 0: Hoare triple {4027#true} call ULTIMATE.init(); {4027#true} is VALID
[2020-07-18 00:48:39,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#true} assume true; {4027#true} is VALID
[2020-07-18 00:48:39,035 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4027#true} {4027#true} #144#return; {4027#true} is VALID
[2020-07-18 00:48:39,035 INFO L263 TraceCheckUtils]: 3: Hoare triple {4027#true} call #t~ret10 := main(); {4027#true} is VALID
[2020-07-18 00:48:39,036 INFO L280 TraceCheckUtils]: 4: Hoare triple {4027#true} havoc ~tagbuf_len~0; {4027#true} is VALID
[2020-07-18 00:48:39,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {4027#true} havoc ~t~0; {4027#true} is VALID
[2020-07-18 00:48:39,036 INFO L280 TraceCheckUtils]: 6: Hoare triple {4027#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4027#true} is VALID
[2020-07-18 00:48:39,036 INFO L280 TraceCheckUtils]: 7: Hoare triple {4027#true} ~tagbuf_len~0 := #t~nondet0; {4027#true} is VALID
[2020-07-18 00:48:39,037 INFO L280 TraceCheckUtils]: 8: Hoare triple {4027#true} havoc #t~nondet0; {4027#true} is VALID
[2020-07-18 00:48:39,042 INFO L280 TraceCheckUtils]: 9: Hoare triple {4027#true} assume ~tagbuf_len~0 >= 1; {4031#(<= 1 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,044 INFO L280 TraceCheckUtils]: 10: Hoare triple {4031#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,046 INFO L280 TraceCheckUtils]: 11: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,047 INFO L280 TraceCheckUtils]: 12: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,049 INFO L280 TraceCheckUtils]: 13: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,049 INFO L280 TraceCheckUtils]: 14: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,050 INFO L280 TraceCheckUtils]: 15: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,051 INFO L280 TraceCheckUtils]: 16: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,051 INFO L280 TraceCheckUtils]: 17: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,054 INFO L280 TraceCheckUtils]: 18: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,054 INFO L263 TraceCheckUtils]: 19: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {4027#true} is VALID
[2020-07-18 00:48:39,054 INFO L280 TraceCheckUtils]: 20: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID
[2020-07-18 00:48:39,055 INFO L280 TraceCheckUtils]: 21: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID
[2020-07-18 00:48:39,055 INFO L280 TraceCheckUtils]: 22: Hoare triple {4027#true} assume true; {4027#true} is VALID
[2020-07-18 00:48:39,063 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {4027#true} {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,063 INFO L263 TraceCheckUtils]: 24: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {4027#true} is VALID
[2020-07-18 00:48:39,064 INFO L280 TraceCheckUtils]: 25: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID
[2020-07-18 00:48:39,064 INFO L280 TraceCheckUtils]: 26: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID
[2020-07-18 00:48:39,064 INFO L280 TraceCheckUtils]: 27: Hoare triple {4027#true} assume true; {4027#true} is VALID
[2020-07-18 00:48:39,065 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4027#true} {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,066 INFO L280 TraceCheckUtils]: 29: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {4042#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,066 INFO L280 TraceCheckUtils]: 30: Hoare triple {4042#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,067 INFO L280 TraceCheckUtils]: 31: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,067 INFO L280 TraceCheckUtils]: 32: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,068 INFO L280 TraceCheckUtils]: 33: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,069 INFO L280 TraceCheckUtils]: 34: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,069 INFO L280 TraceCheckUtils]: 35: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,070 INFO L280 TraceCheckUtils]: 36: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet2; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,070 INFO L263 TraceCheckUtils]: 37: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {4027#true} is VALID
[2020-07-18 00:48:39,071 INFO L280 TraceCheckUtils]: 38: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID
[2020-07-18 00:48:39,071 INFO L280 TraceCheckUtils]: 39: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID
[2020-07-18 00:48:39,071 INFO L280 TraceCheckUtils]: 40: Hoare triple {4027#true} assume true; {4027#true} is VALID
[2020-07-18 00:48:39,072 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {4027#true} {4033#(<= main_~t~0 main_~tagbuf_len~0)} #152#return; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:39,073 INFO L263 TraceCheckUtils]: 42: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {4047#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:39,074 INFO L280 TraceCheckUtils]: 43: Hoare triple {4047#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4048#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:39,075 INFO L280 TraceCheckUtils]: 44: Hoare triple {4048#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4028#false} is VALID
[2020-07-18 00:48:39,075 INFO L280 TraceCheckUtils]: 45: Hoare triple {4028#false} assume !false; {4028#false} is VALID
[2020-07-18 00:48:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:39,081 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:39,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [140696303]
[2020-07-18 00:48:39,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:39,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-07-18 00:48:39,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829768199]
[2020-07-18 00:48:39,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46
[2020-07-18 00:48:39,084 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:39,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states.
[2020-07-18 00:48:39,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:39,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-07-18 00:48:39,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:39,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-07-18 00:48:39,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2020-07-18 00:48:39,130 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand 8 states.
[2020-07-18 00:48:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:39,778 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions.
[2020-07-18 00:48:39,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2020-07-18 00:48:39,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46
[2020-07-18 00:48:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-07-18 00:48:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions.
[2020-07-18 00:48:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-07-18 00:48:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions.
[2020-07-18 00:48:39,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 80 transitions.
[2020-07-18 00:48:39,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:39,868 INFO L225 Difference]: With dead ends: 115
[2020-07-18 00:48:39,868 INFO L226 Difference]: Without dead ends: 113
[2020-07-18 00:48:39,869 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2020-07-18 00:48:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2020-07-18 00:48:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113.
[2020-07-18 00:48:40,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:40,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 113 states.
[2020-07-18 00:48:40,036 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 113 states.
[2020-07-18 00:48:40,036 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 113 states.
[2020-07-18 00:48:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:40,045 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions.
[2020-07-18 00:48:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions.
[2020-07-18 00:48:40,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:40,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:40,046 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 113 states.
[2020-07-18 00:48:40,046 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 113 states.
[2020-07-18 00:48:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:40,051 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions.
[2020-07-18 00:48:40,051 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions.
[2020-07-18 00:48:40,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:40,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:40,052 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:40,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2020-07-18 00:48:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions.
[2020-07-18 00:48:40,059 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 46
[2020-07-18 00:48:40,060 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:40,060 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions.
[2020-07-18 00:48:40,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-07-18 00:48:40,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 113 states and 131 transitions.
[2020-07-18 00:48:40,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions.
[2020-07-18 00:48:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2020-07-18 00:48:40,260 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:40,260 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:40,260 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-07-18 00:48:40,260 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:40,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1826770767, now seen corresponding path program 1 times
[2020-07-18 00:48:40,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:40,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1847994802]
[2020-07-18 00:48:40,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:40,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {4741#true} assume true; {4741#true} is VALID
[2020-07-18 00:48:40,371 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4741#true} {4741#true} #144#return; {4741#true} is VALID
[2020-07-18 00:48:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:40,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID
[2020-07-18 00:48:40,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID
[2020-07-18 00:48:40,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {4741#true} assume true; {4741#true} is VALID
[2020-07-18 00:48:40,377 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4741#true} {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:40,382 INFO L280 TraceCheckUtils]: 0: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID
[2020-07-18 00:48:40,382 INFO L280 TraceCheckUtils]: 1: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID
[2020-07-18 00:48:40,382 INFO L280 TraceCheckUtils]: 2: Hoare triple {4741#true} assume true; {4741#true} is VALID
[2020-07-18 00:48:40,383 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4741#true} {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:40,388 INFO L280 TraceCheckUtils]: 0: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID
[2020-07-18 00:48:40,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID
[2020-07-18 00:48:40,388 INFO L280 TraceCheckUtils]: 2: Hoare triple {4741#true} assume true; {4741#true} is VALID
[2020-07-18 00:48:40,389 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4741#true} {4747#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,389 INFO L263 TraceCheckUtils]: 0: Hoare triple {4741#true} call ULTIMATE.init(); {4741#true} is VALID
[2020-07-18 00:48:40,389 INFO L280 TraceCheckUtils]: 1: Hoare triple {4741#true} assume true; {4741#true} is VALID
[2020-07-18 00:48:40,390 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4741#true} {4741#true} #144#return; {4741#true} is VALID
[2020-07-18 00:48:40,390 INFO L263 TraceCheckUtils]: 3: Hoare triple {4741#true} call #t~ret10 := main(); {4741#true} is VALID
[2020-07-18 00:48:40,390 INFO L280 TraceCheckUtils]: 4: Hoare triple {4741#true} havoc ~tagbuf_len~0; {4741#true} is VALID
[2020-07-18 00:48:40,390 INFO L280 TraceCheckUtils]: 5: Hoare triple {4741#true} havoc ~t~0; {4741#true} is VALID
[2020-07-18 00:48:40,391 INFO L280 TraceCheckUtils]: 6: Hoare triple {4741#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4741#true} is VALID
[2020-07-18 00:48:40,391 INFO L280 TraceCheckUtils]: 7: Hoare triple {4741#true} ~tagbuf_len~0 := #t~nondet0; {4741#true} is VALID
[2020-07-18 00:48:40,391 INFO L280 TraceCheckUtils]: 8: Hoare triple {4741#true} havoc #t~nondet0; {4741#true} is VALID
[2020-07-18 00:48:40,392 INFO L280 TraceCheckUtils]: 9: Hoare triple {4741#true} assume ~tagbuf_len~0 >= 1; {4745#(<= 1 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,392 INFO L280 TraceCheckUtils]: 10: Hoare triple {4745#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,393 INFO L280 TraceCheckUtils]: 11: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,394 INFO L280 TraceCheckUtils]: 12: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,394 INFO L280 TraceCheckUtils]: 13: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,395 INFO L280 TraceCheckUtils]: 14: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,396 INFO L280 TraceCheckUtils]: 15: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,396 INFO L280 TraceCheckUtils]: 16: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,397 INFO L280 TraceCheckUtils]: 17: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,397 INFO L280 TraceCheckUtils]: 18: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,397 INFO L263 TraceCheckUtils]: 19: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {4741#true} is VALID
[2020-07-18 00:48:40,398 INFO L280 TraceCheckUtils]: 20: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID
[2020-07-18 00:48:40,398 INFO L280 TraceCheckUtils]: 21: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID
[2020-07-18 00:48:40,398 INFO L280 TraceCheckUtils]: 22: Hoare triple {4741#true} assume true; {4741#true} is VALID
[2020-07-18 00:48:40,399 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {4741#true} {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,399 INFO L263 TraceCheckUtils]: 24: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {4741#true} is VALID
[2020-07-18 00:48:40,399 INFO L280 TraceCheckUtils]: 25: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID
[2020-07-18 00:48:40,400 INFO L280 TraceCheckUtils]: 26: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID
[2020-07-18 00:48:40,400 INFO L280 TraceCheckUtils]: 27: Hoare triple {4741#true} assume true; {4741#true} is VALID
[2020-07-18 00:48:40,401 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4741#true} {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,402 INFO L280 TraceCheckUtils]: 29: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {4756#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,403 INFO L280 TraceCheckUtils]: 30: Hoare triple {4756#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,403 INFO L280 TraceCheckUtils]: 31: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,404 INFO L280 TraceCheckUtils]: 32: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,404 INFO L280 TraceCheckUtils]: 33: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,405 INFO L280 TraceCheckUtils]: 34: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,405 INFO L280 TraceCheckUtils]: 35: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet5; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,406 INFO L280 TraceCheckUtils]: 36: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet5; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,407 INFO L280 TraceCheckUtils]: 37: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,407 INFO L280 TraceCheckUtils]: 38: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,408 INFO L280 TraceCheckUtils]: 39: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet6; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,408 INFO L263 TraceCheckUtils]: 40: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {4741#true} is VALID
[2020-07-18 00:48:40,408 INFO L280 TraceCheckUtils]: 41: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID
[2020-07-18 00:48:40,408 INFO L280 TraceCheckUtils]: 42: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID
[2020-07-18 00:48:40,409 INFO L280 TraceCheckUtils]: 43: Hoare triple {4741#true} assume true; {4741#true} is VALID
[2020-07-18 00:48:40,409 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4741#true} {4747#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:40,410 INFO L263 TraceCheckUtils]: 45: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {4761#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:40,411 INFO L280 TraceCheckUtils]: 46: Hoare triple {4761#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4762#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:40,411 INFO L280 TraceCheckUtils]: 47: Hoare triple {4762#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4742#false} is VALID
[2020-07-18 00:48:40,412 INFO L280 TraceCheckUtils]: 48: Hoare triple {4742#false} assume !false; {4742#false} is VALID
[2020-07-18 00:48:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:40,414 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:40,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1847994802]
[2020-07-18 00:48:40,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:40,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-07-18 00:48:40,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919926757]
[2020-07-18 00:48:40,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49
[2020-07-18 00:48:40,416 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:40,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states.
[2020-07-18 00:48:40,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:40,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-07-18 00:48:40,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:40,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-07-18 00:48:40,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2020-07-18 00:48:40,460 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 8 states.
[2020-07-18 00:48:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:41,262 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions.
[2020-07-18 00:48:41,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2020-07-18 00:48:41,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49
[2020-07-18 00:48:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-07-18 00:48:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions.
[2020-07-18 00:48:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-07-18 00:48:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions.
[2020-07-18 00:48:41,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 132 transitions.
[2020-07-18 00:48:41,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:41,433 INFO L225 Difference]: With dead ends: 128
[2020-07-18 00:48:41,433 INFO L226 Difference]: Without dead ends: 123
[2020-07-18 00:48:41,434 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2020-07-18 00:48:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states.
[2020-07-18 00:48:41,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117.
[2020-07-18 00:48:41,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:41,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 117 states.
[2020-07-18 00:48:41,575 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 117 states.
[2020-07-18 00:48:41,575 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 117 states.
[2020-07-18 00:48:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:41,581 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions.
[2020-07-18 00:48:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions.
[2020-07-18 00:48:41,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:41,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:41,582 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 123 states.
[2020-07-18 00:48:41,582 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 123 states.
[2020-07-18 00:48:41,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:41,586 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions.
[2020-07-18 00:48:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions.
[2020-07-18 00:48:41,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:41,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:41,588 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:41,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states.
[2020-07-18 00:48:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions.
[2020-07-18 00:48:41,591 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 49
[2020-07-18 00:48:41,592 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:41,592 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions.
[2020-07-18 00:48:41,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-07-18 00:48:41,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 117 states and 134 transitions.
[2020-07-18 00:48:41,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions.
[2020-07-18 00:48:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2020-07-18 00:48:41,760 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:41,760 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:41,761 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-07-18 00:48:41,761 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:41,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1519048418, now seen corresponding path program 1 times
[2020-07-18 00:48:41,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:41,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [282272732]
[2020-07-18 00:48:41,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:41,881 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} assume true; {5509#true} is VALID
[2020-07-18 00:48:41,881 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5509#true} {5509#true} #144#return; {5509#true} is VALID
[2020-07-18 00:48:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:41,885 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID
[2020-07-18 00:48:41,886 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID
[2020-07-18 00:48:41,886 INFO L280 TraceCheckUtils]: 2: Hoare triple {5509#true} assume true; {5509#true} is VALID
[2020-07-18 00:48:41,887 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5509#true} {5513#(<= 0 main_~t~0)} #156#return; {5513#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:41,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID
[2020-07-18 00:48:41,891 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID
[2020-07-18 00:48:41,891 INFO L280 TraceCheckUtils]: 2: Hoare triple {5509#true} assume true; {5509#true} is VALID
[2020-07-18 00:48:41,892 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5509#true} {5513#(<= 0 main_~t~0)} #158#return; {5513#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:41,897 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID
[2020-07-18 00:48:41,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID
[2020-07-18 00:48:41,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {5509#true} assume true; {5509#true} is VALID
[2020-07-18 00:48:41,898 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5509#true} {5523#(<= 1 main_~t~0)} #164#return; {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:41,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID
[2020-07-18 00:48:41,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID
[2020-07-18 00:48:41,903 INFO L280 TraceCheckUtils]: 2: Hoare triple {5509#true} assume true; {5509#true} is VALID
[2020-07-18 00:48:41,903 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5509#true} {5523#(<= 1 main_~t~0)} #166#return; {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,904 INFO L263 TraceCheckUtils]: 0: Hoare triple {5509#true} call ULTIMATE.init(); {5509#true} is VALID
[2020-07-18 00:48:41,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume true; {5509#true} is VALID
[2020-07-18 00:48:41,904 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5509#true} {5509#true} #144#return; {5509#true} is VALID
[2020-07-18 00:48:41,904 INFO L263 TraceCheckUtils]: 3: Hoare triple {5509#true} call #t~ret10 := main(); {5509#true} is VALID
[2020-07-18 00:48:41,904 INFO L280 TraceCheckUtils]: 4: Hoare triple {5509#true} havoc ~tagbuf_len~0; {5509#true} is VALID
[2020-07-18 00:48:41,905 INFO L280 TraceCheckUtils]: 5: Hoare triple {5509#true} havoc ~t~0; {5509#true} is VALID
[2020-07-18 00:48:41,905 INFO L280 TraceCheckUtils]: 6: Hoare triple {5509#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5509#true} is VALID
[2020-07-18 00:48:41,905 INFO L280 TraceCheckUtils]: 7: Hoare triple {5509#true} ~tagbuf_len~0 := #t~nondet0; {5509#true} is VALID
[2020-07-18 00:48:41,905 INFO L280 TraceCheckUtils]: 8: Hoare triple {5509#true} havoc #t~nondet0; {5509#true} is VALID
[2020-07-18 00:48:41,905 INFO L280 TraceCheckUtils]: 9: Hoare triple {5509#true} assume ~tagbuf_len~0 >= 1; {5509#true} is VALID
[2020-07-18 00:48:41,906 INFO L280 TraceCheckUtils]: 10: Hoare triple {5509#true} ~t~0 := 0; {5513#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:41,907 INFO L280 TraceCheckUtils]: 11: Hoare triple {5513#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {5513#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:41,907 INFO L280 TraceCheckUtils]: 12: Hoare triple {5513#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {5513#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:41,908 INFO L280 TraceCheckUtils]: 13: Hoare triple {5513#(<= 0 main_~t~0)} havoc #t~pre1; {5513#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:41,908 INFO L280 TraceCheckUtils]: 14: Hoare triple {5513#(<= 0 main_~t~0)} assume !false; {5513#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:41,909 INFO L280 TraceCheckUtils]: 15: Hoare triple {5513#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {5513#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:41,909 INFO L280 TraceCheckUtils]: 16: Hoare triple {5513#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5513#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:41,910 INFO L280 TraceCheckUtils]: 17: Hoare triple {5513#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {5513#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:41,910 INFO L280 TraceCheckUtils]: 18: Hoare triple {5513#(<= 0 main_~t~0)} havoc #t~nondet2; {5513#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:41,910 INFO L263 TraceCheckUtils]: 19: Hoare triple {5513#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {5509#true} is VALID
[2020-07-18 00:48:41,910 INFO L280 TraceCheckUtils]: 20: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID
[2020-07-18 00:48:41,911 INFO L280 TraceCheckUtils]: 21: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID
[2020-07-18 00:48:41,911 INFO L280 TraceCheckUtils]: 22: Hoare triple {5509#true} assume true; {5509#true} is VALID
[2020-07-18 00:48:41,911 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {5509#true} {5513#(<= 0 main_~t~0)} #156#return; {5513#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:41,912 INFO L263 TraceCheckUtils]: 24: Hoare triple {5513#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {5509#true} is VALID
[2020-07-18 00:48:41,912 INFO L280 TraceCheckUtils]: 25: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID
[2020-07-18 00:48:41,912 INFO L280 TraceCheckUtils]: 26: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID
[2020-07-18 00:48:41,912 INFO L280 TraceCheckUtils]: 27: Hoare triple {5509#true} assume true; {5509#true} is VALID
[2020-07-18 00:48:41,913 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {5509#true} {5513#(<= 0 main_~t~0)} #158#return; {5513#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:41,914 INFO L280 TraceCheckUtils]: 29: Hoare triple {5513#(<= 0 main_~t~0)} #t~post4 := ~t~0; {5522#(<= 0 |main_#t~post4|)} is VALID
[2020-07-18 00:48:41,914 INFO L280 TraceCheckUtils]: 30: Hoare triple {5522#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,915 INFO L280 TraceCheckUtils]: 31: Hoare triple {5523#(<= 1 main_~t~0)} havoc #t~post4; {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,915 INFO L280 TraceCheckUtils]: 32: Hoare triple {5523#(<= 1 main_~t~0)} assume !false; {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,916 INFO L280 TraceCheckUtils]: 33: Hoare triple {5523#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,916 INFO L280 TraceCheckUtils]: 34: Hoare triple {5523#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,917 INFO L280 TraceCheckUtils]: 35: Hoare triple {5523#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,917 INFO L280 TraceCheckUtils]: 36: Hoare triple {5523#(<= 1 main_~t~0)} havoc #t~nondet5; {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,918 INFO L280 TraceCheckUtils]: 37: Hoare triple {5523#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,918 INFO L280 TraceCheckUtils]: 38: Hoare triple {5523#(<= 1 main_~t~0)} assume 0 != #t~nondet6; {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,919 INFO L280 TraceCheckUtils]: 39: Hoare triple {5523#(<= 1 main_~t~0)} havoc #t~nondet6; {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,919 INFO L263 TraceCheckUtils]: 40: Hoare triple {5523#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {5509#true} is VALID
[2020-07-18 00:48:41,919 INFO L280 TraceCheckUtils]: 41: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID
[2020-07-18 00:48:41,919 INFO L280 TraceCheckUtils]: 42: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID
[2020-07-18 00:48:41,919 INFO L280 TraceCheckUtils]: 43: Hoare triple {5509#true} assume true; {5509#true} is VALID
[2020-07-18 00:48:41,920 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {5509#true} {5523#(<= 1 main_~t~0)} #164#return; {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,920 INFO L263 TraceCheckUtils]: 45: Hoare triple {5523#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {5509#true} is VALID
[2020-07-18 00:48:41,920 INFO L280 TraceCheckUtils]: 46: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID
[2020-07-18 00:48:41,921 INFO L280 TraceCheckUtils]: 47: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID
[2020-07-18 00:48:41,921 INFO L280 TraceCheckUtils]: 48: Hoare triple {5509#true} assume true; {5509#true} is VALID
[2020-07-18 00:48:41,922 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {5509#true} {5523#(<= 1 main_~t~0)} #166#return; {5523#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:41,922 INFO L280 TraceCheckUtils]: 50: Hoare triple {5523#(<= 1 main_~t~0)} #t~post7 := ~t~0; {5532#(<= 1 |main_#t~post7|)} is VALID
[2020-07-18 00:48:41,923 INFO L280 TraceCheckUtils]: 51: Hoare triple {5532#(<= 1 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {5533#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:41,923 INFO L280 TraceCheckUtils]: 52: Hoare triple {5533#(<= 2 main_~t~0)} havoc #t~post7; {5533#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:41,924 INFO L280 TraceCheckUtils]: 53: Hoare triple {5533#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {5533#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:41,925 INFO L263 TraceCheckUtils]: 54: Hoare triple {5533#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {5534#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:41,925 INFO L280 TraceCheckUtils]: 55: Hoare triple {5534#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5535#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:41,925 INFO L280 TraceCheckUtils]: 56: Hoare triple {5535#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5510#false} is VALID
[2020-07-18 00:48:41,926 INFO L280 TraceCheckUtils]: 57: Hoare triple {5510#false} assume !false; {5510#false} is VALID
[2020-07-18 00:48:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:41,928 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:41,928 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [282272732]
[2020-07-18 00:48:41,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:41,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-07-18 00:48:41,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548387505]
[2020-07-18 00:48:41,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58
[2020-07-18 00:48:41,929 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:41,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states.
[2020-07-18 00:48:41,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:41,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-07-18 00:48:41,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:41,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-07-18 00:48:41,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2020-07-18 00:48:41,983 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 9 states.
[2020-07-18 00:48:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:42,807 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions.
[2020-07-18 00:48:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2020-07-18 00:48:42,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58
[2020-07-18 00:48:42,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-18 00:48:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions.
[2020-07-18 00:48:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-18 00:48:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions.
[2020-07-18 00:48:42,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 135 transitions.
[2020-07-18 00:48:42,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:42,954 INFO L225 Difference]: With dead ends: 135
[2020-07-18 00:48:42,954 INFO L226 Difference]: Without dead ends: 133
[2020-07-18 00:48:42,956 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182
[2020-07-18 00:48:42,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2020-07-18 00:48:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126.
[2020-07-18 00:48:43,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:43,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 126 states.
[2020-07-18 00:48:43,126 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 126 states.
[2020-07-18 00:48:43,126 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 126 states.
[2020-07-18 00:48:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:43,130 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions.
[2020-07-18 00:48:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions.
[2020-07-18 00:48:43,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:43,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:43,131 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 133 states.
[2020-07-18 00:48:43,131 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 133 states.
[2020-07-18 00:48:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:43,135 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions.
[2020-07-18 00:48:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions.
[2020-07-18 00:48:43,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:43,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:43,136 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:43,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states.
[2020-07-18 00:48:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions.
[2020-07-18 00:48:43,139 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 58
[2020-07-18 00:48:43,140 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:43,140 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions.
[2020-07-18 00:48:43,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-07-18 00:48:43,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states and 143 transitions.
[2020-07-18 00:48:43,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions.
[2020-07-18 00:48:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2020-07-18 00:48:43,318 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:43,318 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:43,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-07-18 00:48:43,321 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:43,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:43,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1733407875, now seen corresponding path program 1 times
[2020-07-18 00:48:43,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:43,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [541045590]
[2020-07-18 00:48:43,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:43,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} assume true; {6336#true} is VALID
[2020-07-18 00:48:43,452 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6336#true} {6336#true} #144#return; {6336#true} is VALID
[2020-07-18 00:48:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:43,458 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID
[2020-07-18 00:48:43,458 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID
[2020-07-18 00:48:43,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID
[2020-07-18 00:48:43,459 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6340#(<= 0 main_~t~0)} #152#return; {6340#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:43,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID
[2020-07-18 00:48:43,468 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID
[2020-07-18 00:48:43,469 INFO L280 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID
[2020-07-18 00:48:43,470 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6340#(<= 0 main_~t~0)} #154#return; {6340#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:43,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID
[2020-07-18 00:48:43,478 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID
[2020-07-18 00:48:43,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID
[2020-07-18 00:48:43,480 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6350#(<= 1 main_~t~0)} #156#return; {6350#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:43,491 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID
[2020-07-18 00:48:43,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID
[2020-07-18 00:48:43,491 INFO L280 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID
[2020-07-18 00:48:43,492 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6350#(<= 1 main_~t~0)} #158#return; {6350#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:43,493 INFO L263 TraceCheckUtils]: 0: Hoare triple {6336#true} call ULTIMATE.init(); {6336#true} is VALID
[2020-07-18 00:48:43,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume true; {6336#true} is VALID
[2020-07-18 00:48:43,493 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6336#true} {6336#true} #144#return; {6336#true} is VALID
[2020-07-18 00:48:43,493 INFO L263 TraceCheckUtils]: 3: Hoare triple {6336#true} call #t~ret10 := main(); {6336#true} is VALID
[2020-07-18 00:48:43,493 INFO L280 TraceCheckUtils]: 4: Hoare triple {6336#true} havoc ~tagbuf_len~0; {6336#true} is VALID
[2020-07-18 00:48:43,494 INFO L280 TraceCheckUtils]: 5: Hoare triple {6336#true} havoc ~t~0; {6336#true} is VALID
[2020-07-18 00:48:43,494 INFO L280 TraceCheckUtils]: 6: Hoare triple {6336#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {6336#true} is VALID
[2020-07-18 00:48:43,494 INFO L280 TraceCheckUtils]: 7: Hoare triple {6336#true} ~tagbuf_len~0 := #t~nondet0; {6336#true} is VALID
[2020-07-18 00:48:43,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {6336#true} havoc #t~nondet0; {6336#true} is VALID
[2020-07-18 00:48:43,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {6336#true} assume ~tagbuf_len~0 >= 1; {6336#true} is VALID
[2020-07-18 00:48:43,495 INFO L280 TraceCheckUtils]: 10: Hoare triple {6336#true} ~t~0 := 0; {6340#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:43,496 INFO L280 TraceCheckUtils]: 11: Hoare triple {6340#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {6340#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:43,496 INFO L280 TraceCheckUtils]: 12: Hoare triple {6340#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {6340#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:43,497 INFO L280 TraceCheckUtils]: 13: Hoare triple {6340#(<= 0 main_~t~0)} havoc #t~pre1; {6340#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:43,497 INFO L280 TraceCheckUtils]: 14: Hoare triple {6340#(<= 0 main_~t~0)} assume !false; {6340#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:43,498 INFO L280 TraceCheckUtils]: 15: Hoare triple {6340#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {6340#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:43,498 INFO L280 TraceCheckUtils]: 16: Hoare triple {6340#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {6340#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:43,499 INFO L280 TraceCheckUtils]: 17: Hoare triple {6340#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {6340#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:43,502 INFO L280 TraceCheckUtils]: 18: Hoare triple {6340#(<= 0 main_~t~0)} havoc #t~nondet2; {6340#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:43,502 INFO L263 TraceCheckUtils]: 19: Hoare triple {6340#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {6336#true} is VALID
[2020-07-18 00:48:43,502 INFO L280 TraceCheckUtils]: 20: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID
[2020-07-18 00:48:43,503 INFO L280 TraceCheckUtils]: 21: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID
[2020-07-18 00:48:43,503 INFO L280 TraceCheckUtils]: 22: Hoare triple {6336#true} assume true; {6336#true} is VALID
[2020-07-18 00:48:43,504 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {6336#true} {6340#(<= 0 main_~t~0)} #152#return; {6340#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:43,504 INFO L263 TraceCheckUtils]: 24: Hoare triple {6340#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {6336#true} is VALID
[2020-07-18 00:48:43,504 INFO L280 TraceCheckUtils]: 25: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID
[2020-07-18 00:48:43,504 INFO L280 TraceCheckUtils]: 26: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID
[2020-07-18 00:48:43,504 INFO L280 TraceCheckUtils]: 27: Hoare triple {6336#true} assume true; {6336#true} is VALID
[2020-07-18 00:48:43,505 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {6336#true} {6340#(<= 0 main_~t~0)} #154#return; {6340#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:43,506 INFO L280 TraceCheckUtils]: 29: Hoare triple {6340#(<= 0 main_~t~0)} #t~post3 := ~t~0; {6349#(<= 0 |main_#t~post3|)} is VALID
[2020-07-18 00:48:43,507 INFO L280 TraceCheckUtils]: 30: Hoare triple {6349#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {6350#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:43,507 INFO L280 TraceCheckUtils]: 31: Hoare triple {6350#(<= 1 main_~t~0)} havoc #t~post3; {6350#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:43,508 INFO L280 TraceCheckUtils]: 32: Hoare triple {6350#(<= 1 main_~t~0)} assume !false; {6350#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:43,508 INFO L280 TraceCheckUtils]: 33: Hoare triple {6350#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {6350#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:43,516 INFO L280 TraceCheckUtils]: 34: Hoare triple {6350#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {6350#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:43,517 INFO L280 TraceCheckUtils]: 35: Hoare triple {6350#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {6350#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:43,517 INFO L280 TraceCheckUtils]: 36: Hoare triple {6350#(<= 1 main_~t~0)} havoc #t~nondet2; {6350#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:43,518 INFO L263 TraceCheckUtils]: 37: Hoare triple {6350#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {6336#true} is VALID
[2020-07-18 00:48:43,518 INFO L280 TraceCheckUtils]: 38: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID
[2020-07-18 00:48:43,518 INFO L280 TraceCheckUtils]: 39: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID
[2020-07-18 00:48:43,518 INFO L280 TraceCheckUtils]: 40: Hoare triple {6336#true} assume true; {6336#true} is VALID
[2020-07-18 00:48:43,519 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {6336#true} {6350#(<= 1 main_~t~0)} #156#return; {6350#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:43,519 INFO L263 TraceCheckUtils]: 42: Hoare triple {6350#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {6336#true} is VALID
[2020-07-18 00:48:43,519 INFO L280 TraceCheckUtils]: 43: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID
[2020-07-18 00:48:43,520 INFO L280 TraceCheckUtils]: 44: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID
[2020-07-18 00:48:43,520 INFO L280 TraceCheckUtils]: 45: Hoare triple {6336#true} assume true; {6336#true} is VALID
[2020-07-18 00:48:43,521 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {6336#true} {6350#(<= 1 main_~t~0)} #158#return; {6350#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:43,521 INFO L280 TraceCheckUtils]: 47: Hoare triple {6350#(<= 1 main_~t~0)} #t~post4 := ~t~0; {6359#(<= 1 |main_#t~post4|)} is VALID
[2020-07-18 00:48:43,522 INFO L280 TraceCheckUtils]: 48: Hoare triple {6359#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {6360#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:43,522 INFO L280 TraceCheckUtils]: 49: Hoare triple {6360#(<= 2 main_~t~0)} havoc #t~post4; {6360#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:43,523 INFO L280 TraceCheckUtils]: 50: Hoare triple {6360#(<= 2 main_~t~0)} assume !false; {6360#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:43,523 INFO L280 TraceCheckUtils]: 51: Hoare triple {6360#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {6360#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:43,524 INFO L280 TraceCheckUtils]: 52: Hoare triple {6360#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {6360#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:43,525 INFO L280 TraceCheckUtils]: 53: Hoare triple {6360#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {6360#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:43,525 INFO L280 TraceCheckUtils]: 54: Hoare triple {6360#(<= 2 main_~t~0)} havoc #t~nondet5; {6360#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:43,526 INFO L280 TraceCheckUtils]: 55: Hoare triple {6360#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {6360#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:43,526 INFO L280 TraceCheckUtils]: 56: Hoare triple {6360#(<= 2 main_~t~0)} assume !(0 != #t~nondet6); {6360#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:43,527 INFO L280 TraceCheckUtils]: 57: Hoare triple {6360#(<= 2 main_~t~0)} havoc #t~nondet6; {6360#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:43,528 INFO L263 TraceCheckUtils]: 58: Hoare triple {6360#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {6361#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:43,528 INFO L280 TraceCheckUtils]: 59: Hoare triple {6361#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6362#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:43,529 INFO L280 TraceCheckUtils]: 60: Hoare triple {6362#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6337#false} is VALID
[2020-07-18 00:48:43,529 INFO L280 TraceCheckUtils]: 61: Hoare triple {6337#false} assume !false; {6337#false} is VALID
[2020-07-18 00:48:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:43,532 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:43,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [541045590]
[2020-07-18 00:48:43,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:43,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-07-18 00:48:43,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995739227]
[2020-07-18 00:48:43,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62
[2020-07-18 00:48:43,535 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:43,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states.
[2020-07-18 00:48:43,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:43,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-07-18 00:48:43,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:43,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-07-18 00:48:43,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2020-07-18 00:48:43,589 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 9 states.
[2020-07-18 00:48:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:44,589 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions.
[2020-07-18 00:48:44,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2020-07-18 00:48:44,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62
[2020-07-18 00:48:44,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-18 00:48:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions.
[2020-07-18 00:48:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-18 00:48:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions.
[2020-07-18 00:48:44,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 132 transitions.
[2020-07-18 00:48:44,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:44,722 INFO L225 Difference]: With dead ends: 158
[2020-07-18 00:48:44,723 INFO L226 Difference]: Without dead ends: 156
[2020-07-18 00:48:44,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182
[2020-07-18 00:48:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2020-07-18 00:48:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147.
[2020-07-18 00:48:44,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:44,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 147 states.
[2020-07-18 00:48:44,905 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 147 states.
[2020-07-18 00:48:44,905 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 147 states.
[2020-07-18 00:48:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:44,910 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions.
[2020-07-18 00:48:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions.
[2020-07-18 00:48:44,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:44,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:44,912 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 156 states.
[2020-07-18 00:48:44,912 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 156 states.
[2020-07-18 00:48:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:44,916 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions.
[2020-07-18 00:48:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions.
[2020-07-18 00:48:44,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:44,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:44,917 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:44,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2020-07-18 00:48:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions.
[2020-07-18 00:48:44,922 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 62
[2020-07-18 00:48:44,922 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:44,922 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions.
[2020-07-18 00:48:44,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-07-18 00:48:44,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 147 states and 169 transitions.
[2020-07-18 00:48:45,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions.
[2020-07-18 00:48:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2020-07-18 00:48:45,140 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:45,141 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:45,141 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-07-18 00:48:45,141 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:45,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1967257859, now seen corresponding path program 1 times
[2020-07-18 00:48:45,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:45,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1060702742]
[2020-07-18 00:48:45,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:45,334 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} assume true; {7297#true} is VALID
[2020-07-18 00:48:45,334 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7297#true} {7297#true} #144#return; {7297#true} is VALID
[2020-07-18 00:48:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:45,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID
[2020-07-18 00:48:45,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID
[2020-07-18 00:48:45,348 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID
[2020-07-18 00:48:45,349 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:45,354 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID
[2020-07-18 00:48:45,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID
[2020-07-18 00:48:45,354 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID
[2020-07-18 00:48:45,355 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:45,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID
[2020-07-18 00:48:45,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID
[2020-07-18 00:48:45,360 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID
[2020-07-18 00:48:45,361 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:45,365 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID
[2020-07-18 00:48:45,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID
[2020-07-18 00:48:45,366 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID
[2020-07-18 00:48:45,366 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:45,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID
[2020-07-18 00:48:45,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID
[2020-07-18 00:48:45,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID
[2020-07-18 00:48:45,376 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7303#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,377 INFO L263 TraceCheckUtils]: 0: Hoare triple {7297#true} call ULTIMATE.init(); {7297#true} is VALID
[2020-07-18 00:48:45,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume true; {7297#true} is VALID
[2020-07-18 00:48:45,377 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7297#true} {7297#true} #144#return; {7297#true} is VALID
[2020-07-18 00:48:45,377 INFO L263 TraceCheckUtils]: 3: Hoare triple {7297#true} call #t~ret10 := main(); {7297#true} is VALID
[2020-07-18 00:48:45,377 INFO L280 TraceCheckUtils]: 4: Hoare triple {7297#true} havoc ~tagbuf_len~0; {7297#true} is VALID
[2020-07-18 00:48:45,378 INFO L280 TraceCheckUtils]: 5: Hoare triple {7297#true} havoc ~t~0; {7297#true} is VALID
[2020-07-18 00:48:45,378 INFO L280 TraceCheckUtils]: 6: Hoare triple {7297#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7297#true} is VALID
[2020-07-18 00:48:45,378 INFO L280 TraceCheckUtils]: 7: Hoare triple {7297#true} ~tagbuf_len~0 := #t~nondet0; {7297#true} is VALID
[2020-07-18 00:48:45,378 INFO L280 TraceCheckUtils]: 8: Hoare triple {7297#true} havoc #t~nondet0; {7297#true} is VALID
[2020-07-18 00:48:45,379 INFO L280 TraceCheckUtils]: 9: Hoare triple {7297#true} assume ~tagbuf_len~0 >= 1; {7301#(<= 1 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,380 INFO L280 TraceCheckUtils]: 10: Hoare triple {7301#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,380 INFO L280 TraceCheckUtils]: 11: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,381 INFO L280 TraceCheckUtils]: 12: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,382 INFO L280 TraceCheckUtils]: 13: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,382 INFO L280 TraceCheckUtils]: 14: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,383 INFO L280 TraceCheckUtils]: 15: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,384 INFO L280 TraceCheckUtils]: 16: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,384 INFO L280 TraceCheckUtils]: 17: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,385 INFO L280 TraceCheckUtils]: 18: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,385 INFO L263 TraceCheckUtils]: 19: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {7297#true} is VALID
[2020-07-18 00:48:45,385 INFO L280 TraceCheckUtils]: 20: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID
[2020-07-18 00:48:45,386 INFO L280 TraceCheckUtils]: 21: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID
[2020-07-18 00:48:45,386 INFO L280 TraceCheckUtils]: 22: Hoare triple {7297#true} assume true; {7297#true} is VALID
[2020-07-18 00:48:45,387 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,387 INFO L263 TraceCheckUtils]: 24: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {7297#true} is VALID
[2020-07-18 00:48:45,387 INFO L280 TraceCheckUtils]: 25: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID
[2020-07-18 00:48:45,387 INFO L280 TraceCheckUtils]: 26: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID
[2020-07-18 00:48:45,387 INFO L280 TraceCheckUtils]: 27: Hoare triple {7297#true} assume true; {7297#true} is VALID
[2020-07-18 00:48:45,388 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,389 INFO L280 TraceCheckUtils]: 29: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {7312#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,390 INFO L280 TraceCheckUtils]: 30: Hoare triple {7312#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,390 INFO L280 TraceCheckUtils]: 31: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,391 INFO L280 TraceCheckUtils]: 32: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,392 INFO L280 TraceCheckUtils]: 33: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,393 INFO L280 TraceCheckUtils]: 34: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,393 INFO L280 TraceCheckUtils]: 35: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,394 INFO L280 TraceCheckUtils]: 36: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,394 INFO L280 TraceCheckUtils]: 37: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,395 INFO L280 TraceCheckUtils]: 38: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet6; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,395 INFO L280 TraceCheckUtils]: 39: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,396 INFO L263 TraceCheckUtils]: 40: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {7297#true} is VALID
[2020-07-18 00:48:45,396 INFO L280 TraceCheckUtils]: 41: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID
[2020-07-18 00:48:45,396 INFO L280 TraceCheckUtils]: 42: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID
[2020-07-18 00:48:45,396 INFO L280 TraceCheckUtils]: 43: Hoare triple {7297#true} assume true; {7297#true} is VALID
[2020-07-18 00:48:45,397 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,397 INFO L263 TraceCheckUtils]: 45: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {7297#true} is VALID
[2020-07-18 00:48:45,397 INFO L280 TraceCheckUtils]: 46: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID
[2020-07-18 00:48:45,398 INFO L280 TraceCheckUtils]: 47: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID
[2020-07-18 00:48:45,398 INFO L280 TraceCheckUtils]: 48: Hoare triple {7297#true} assume true; {7297#true} is VALID
[2020-07-18 00:48:45,399 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,400 INFO L280 TraceCheckUtils]: 50: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post7 := ~t~0; {7321#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,400 INFO L280 TraceCheckUtils]: 51: Hoare triple {7321#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post7; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,401 INFO L280 TraceCheckUtils]: 52: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post7; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,402 INFO L280 TraceCheckUtils]: 53: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,402 INFO L263 TraceCheckUtils]: 54: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {7297#true} is VALID
[2020-07-18 00:48:45,402 INFO L280 TraceCheckUtils]: 55: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID
[2020-07-18 00:48:45,402 INFO L280 TraceCheckUtils]: 56: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID
[2020-07-18 00:48:45,402 INFO L280 TraceCheckUtils]: 57: Hoare triple {7297#true} assume true; {7297#true} is VALID
[2020-07-18 00:48:45,403 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {7297#true} {7303#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:45,404 INFO L263 TraceCheckUtils]: 59: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {7326#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:45,405 INFO L280 TraceCheckUtils]: 60: Hoare triple {7326#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {7327#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:45,406 INFO L280 TraceCheckUtils]: 61: Hoare triple {7327#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7298#false} is VALID
[2020-07-18 00:48:45,406 INFO L280 TraceCheckUtils]: 62: Hoare triple {7298#false} assume !false; {7298#false} is VALID
[2020-07-18 00:48:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:45,410 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:45,410 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1060702742]
[2020-07-18 00:48:45,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:45,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-07-18 00:48:45,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375836726]
[2020-07-18 00:48:45,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63
[2020-07-18 00:48:45,412 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:45,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states.
[2020-07-18 00:48:45,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:45,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-07-18 00:48:45,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:45,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-07-18 00:48:45,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2020-07-18 00:48:45,470 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 9 states.
[2020-07-18 00:48:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:46,455 INFO L93 Difference]: Finished difference Result 158 states and 180 transitions.
[2020-07-18 00:48:46,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2020-07-18 00:48:46,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63
[2020-07-18 00:48:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-18 00:48:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 129 transitions.
[2020-07-18 00:48:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-18 00:48:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 129 transitions.
[2020-07-18 00:48:46,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 129 transitions.
[2020-07-18 00:48:46,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:46,585 INFO L225 Difference]: With dead ends: 158
[2020-07-18 00:48:46,585 INFO L226 Difference]: Without dead ends: 156
[2020-07-18 00:48:46,585 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210
[2020-07-18 00:48:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2020-07-18 00:48:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152.
[2020-07-18 00:48:46,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:46,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 152 states.
[2020-07-18 00:48:46,796 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 152 states.
[2020-07-18 00:48:46,796 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 152 states.
[2020-07-18 00:48:46,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:46,801 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions.
[2020-07-18 00:48:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions.
[2020-07-18 00:48:46,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:46,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:46,802 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 156 states.
[2020-07-18 00:48:46,802 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 156 states.
[2020-07-18 00:48:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:46,809 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions.
[2020-07-18 00:48:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions.
[2020-07-18 00:48:46,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:46,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:46,811 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:46,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states.
[2020-07-18 00:48:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions.
[2020-07-18 00:48:46,818 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 63
[2020-07-18 00:48:46,819 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:46,819 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions.
[2020-07-18 00:48:46,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-07-18 00:48:46,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 152 states and 174 transitions.
[2020-07-18 00:48:47,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions.
[2020-07-18 00:48:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2020-07-18 00:48:47,039 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:47,039 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:47,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-07-18 00:48:47,039 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:47,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:47,040 INFO L82 PathProgramCache]: Analyzing trace with hash -822659134, now seen corresponding path program 1 times
[2020-07-18 00:48:47,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:47,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [706501627]
[2020-07-18 00:48:47,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:47,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} assume true; {8274#true} is VALID
[2020-07-18 00:48:47,137 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8274#true} {8274#true} #144#return; {8274#true} is VALID
[2020-07-18 00:48:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:47,140 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID
[2020-07-18 00:48:47,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID
[2020-07-18 00:48:47,141 INFO L280 TraceCheckUtils]: 2: Hoare triple {8274#true} assume true; {8274#true} is VALID
[2020-07-18 00:48:47,141 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8274#true} {8278#(<= 0 main_~t~0)} #156#return; {8278#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:47,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID
[2020-07-18 00:48:47,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID
[2020-07-18 00:48:47,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {8274#true} assume true; {8274#true} is VALID
[2020-07-18 00:48:47,150 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8274#true} {8278#(<= 0 main_~t~0)} #158#return; {8278#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:47,156 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID
[2020-07-18 00:48:47,156 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID
[2020-07-18 00:48:47,156 INFO L280 TraceCheckUtils]: 2: Hoare triple {8274#true} assume true; {8274#true} is VALID
[2020-07-18 00:48:47,157 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8274#true} {8288#(<= 1 main_~t~0)} #172#return; {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:47,161 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID
[2020-07-18 00:48:47,161 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID
[2020-07-18 00:48:47,162 INFO L280 TraceCheckUtils]: 2: Hoare triple {8274#true} assume true; {8274#true} is VALID
[2020-07-18 00:48:47,174 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8274#true} {8288#(<= 1 main_~t~0)} #174#return; {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,174 INFO L263 TraceCheckUtils]: 0: Hoare triple {8274#true} call ULTIMATE.init(); {8274#true} is VALID
[2020-07-18 00:48:47,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume true; {8274#true} is VALID
[2020-07-18 00:48:47,175 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8274#true} {8274#true} #144#return; {8274#true} is VALID
[2020-07-18 00:48:47,175 INFO L263 TraceCheckUtils]: 3: Hoare triple {8274#true} call #t~ret10 := main(); {8274#true} is VALID
[2020-07-18 00:48:47,175 INFO L280 TraceCheckUtils]: 4: Hoare triple {8274#true} havoc ~tagbuf_len~0; {8274#true} is VALID
[2020-07-18 00:48:47,175 INFO L280 TraceCheckUtils]: 5: Hoare triple {8274#true} havoc ~t~0; {8274#true} is VALID
[2020-07-18 00:48:47,175 INFO L280 TraceCheckUtils]: 6: Hoare triple {8274#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8274#true} is VALID
[2020-07-18 00:48:47,176 INFO L280 TraceCheckUtils]: 7: Hoare triple {8274#true} ~tagbuf_len~0 := #t~nondet0; {8274#true} is VALID
[2020-07-18 00:48:47,176 INFO L280 TraceCheckUtils]: 8: Hoare triple {8274#true} havoc #t~nondet0; {8274#true} is VALID
[2020-07-18 00:48:47,176 INFO L280 TraceCheckUtils]: 9: Hoare triple {8274#true} assume ~tagbuf_len~0 >= 1; {8274#true} is VALID
[2020-07-18 00:48:47,177 INFO L280 TraceCheckUtils]: 10: Hoare triple {8274#true} ~t~0 := 0; {8278#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:47,177 INFO L280 TraceCheckUtils]: 11: Hoare triple {8278#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {8278#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:47,178 INFO L280 TraceCheckUtils]: 12: Hoare triple {8278#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {8278#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:47,178 INFO L280 TraceCheckUtils]: 13: Hoare triple {8278#(<= 0 main_~t~0)} havoc #t~pre1; {8278#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:47,179 INFO L280 TraceCheckUtils]: 14: Hoare triple {8278#(<= 0 main_~t~0)} assume !false; {8278#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:47,179 INFO L280 TraceCheckUtils]: 15: Hoare triple {8278#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {8278#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:47,180 INFO L280 TraceCheckUtils]: 16: Hoare triple {8278#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8278#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:47,180 INFO L280 TraceCheckUtils]: 17: Hoare triple {8278#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {8278#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:47,181 INFO L280 TraceCheckUtils]: 18: Hoare triple {8278#(<= 0 main_~t~0)} havoc #t~nondet2; {8278#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:47,181 INFO L263 TraceCheckUtils]: 19: Hoare triple {8278#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {8274#true} is VALID
[2020-07-18 00:48:47,181 INFO L280 TraceCheckUtils]: 20: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID
[2020-07-18 00:48:47,181 INFO L280 TraceCheckUtils]: 21: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID
[2020-07-18 00:48:47,181 INFO L280 TraceCheckUtils]: 22: Hoare triple {8274#true} assume true; {8274#true} is VALID
[2020-07-18 00:48:47,182 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {8274#true} {8278#(<= 0 main_~t~0)} #156#return; {8278#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:47,182 INFO L263 TraceCheckUtils]: 24: Hoare triple {8278#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {8274#true} is VALID
[2020-07-18 00:48:47,182 INFO L280 TraceCheckUtils]: 25: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID
[2020-07-18 00:48:47,183 INFO L280 TraceCheckUtils]: 26: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID
[2020-07-18 00:48:47,183 INFO L280 TraceCheckUtils]: 27: Hoare triple {8274#true} assume true; {8274#true} is VALID
[2020-07-18 00:48:47,183 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {8274#true} {8278#(<= 0 main_~t~0)} #158#return; {8278#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:47,184 INFO L280 TraceCheckUtils]: 29: Hoare triple {8278#(<= 0 main_~t~0)} #t~post4 := ~t~0; {8287#(<= 0 |main_#t~post4|)} is VALID
[2020-07-18 00:48:47,185 INFO L280 TraceCheckUtils]: 30: Hoare triple {8287#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,185 INFO L280 TraceCheckUtils]: 31: Hoare triple {8288#(<= 1 main_~t~0)} havoc #t~post4; {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,186 INFO L280 TraceCheckUtils]: 32: Hoare triple {8288#(<= 1 main_~t~0)} assume !false; {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,186 INFO L280 TraceCheckUtils]: 33: Hoare triple {8288#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,187 INFO L280 TraceCheckUtils]: 34: Hoare triple {8288#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,187 INFO L280 TraceCheckUtils]: 35: Hoare triple {8288#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,188 INFO L280 TraceCheckUtils]: 36: Hoare triple {8288#(<= 1 main_~t~0)} havoc #t~nondet5; {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,188 INFO L280 TraceCheckUtils]: 37: Hoare triple {8288#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,189 INFO L280 TraceCheckUtils]: 38: Hoare triple {8288#(<= 1 main_~t~0)} assume !(0 != #t~nondet6); {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,190 INFO L280 TraceCheckUtils]: 39: Hoare triple {8288#(<= 1 main_~t~0)} havoc #t~nondet6; {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,190 INFO L263 TraceCheckUtils]: 40: Hoare triple {8288#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {8274#true} is VALID
[2020-07-18 00:48:47,190 INFO L280 TraceCheckUtils]: 41: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID
[2020-07-18 00:48:47,190 INFO L280 TraceCheckUtils]: 42: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID
[2020-07-18 00:48:47,190 INFO L280 TraceCheckUtils]: 43: Hoare triple {8274#true} assume true; {8274#true} is VALID
[2020-07-18 00:48:47,191 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {8274#true} {8288#(<= 1 main_~t~0)} #172#return; {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,191 INFO L263 TraceCheckUtils]: 45: Hoare triple {8288#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {8274#true} is VALID
[2020-07-18 00:48:47,192 INFO L280 TraceCheckUtils]: 46: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID
[2020-07-18 00:48:47,192 INFO L280 TraceCheckUtils]: 47: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID
[2020-07-18 00:48:47,192 INFO L280 TraceCheckUtils]: 48: Hoare triple {8274#true} assume true; {8274#true} is VALID
[2020-07-18 00:48:47,193 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {8274#true} {8288#(<= 1 main_~t~0)} #174#return; {8288#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:47,194 INFO L280 TraceCheckUtils]: 50: Hoare triple {8288#(<= 1 main_~t~0)} #t~post9 := ~t~0; {8297#(<= 1 |main_#t~post9|)} is VALID
[2020-07-18 00:48:47,194 INFO L280 TraceCheckUtils]: 51: Hoare triple {8297#(<= 1 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {8298#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:47,195 INFO L280 TraceCheckUtils]: 52: Hoare triple {8298#(<= 2 main_~t~0)} havoc #t~post9; {8298#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:47,195 INFO L280 TraceCheckUtils]: 53: Hoare triple {8298#(<= 2 main_~t~0)} assume !false; {8298#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:47,196 INFO L280 TraceCheckUtils]: 54: Hoare triple {8298#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {8298#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:47,197 INFO L280 TraceCheckUtils]: 55: Hoare triple {8298#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8298#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:47,197 INFO L280 TraceCheckUtils]: 56: Hoare triple {8298#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {8298#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:47,198 INFO L280 TraceCheckUtils]: 57: Hoare triple {8298#(<= 2 main_~t~0)} havoc #t~nondet5; {8298#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:47,198 INFO L280 TraceCheckUtils]: 58: Hoare triple {8298#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {8298#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:47,199 INFO L280 TraceCheckUtils]: 59: Hoare triple {8298#(<= 2 main_~t~0)} assume !(0 != #t~nondet6); {8298#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:47,199 INFO L280 TraceCheckUtils]: 60: Hoare triple {8298#(<= 2 main_~t~0)} havoc #t~nondet6; {8298#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:47,200 INFO L263 TraceCheckUtils]: 61: Hoare triple {8298#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {8299#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:47,200 INFO L280 TraceCheckUtils]: 62: Hoare triple {8299#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {8300#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:47,201 INFO L280 TraceCheckUtils]: 63: Hoare triple {8300#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8275#false} is VALID
[2020-07-18 00:48:47,201 INFO L280 TraceCheckUtils]: 64: Hoare triple {8275#false} assume !false; {8275#false} is VALID
[2020-07-18 00:48:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:47,205 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:47,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [706501627]
[2020-07-18 00:48:47,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:47,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-07-18 00:48:47,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210619916]
[2020-07-18 00:48:47,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65
[2020-07-18 00:48:47,206 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:47,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states.
[2020-07-18 00:48:47,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:47,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-07-18 00:48:47,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:47,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-07-18 00:48:47,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2020-07-18 00:48:47,258 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 9 states.
[2020-07-18 00:48:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:48,312 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions.
[2020-07-18 00:48:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2020-07-18 00:48:48,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65
[2020-07-18 00:48:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-18 00:48:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions.
[2020-07-18 00:48:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-18 00:48:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions.
[2020-07-18 00:48:48,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 160 transitions.
[2020-07-18 00:48:48,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:48,517 INFO L225 Difference]: With dead ends: 187
[2020-07-18 00:48:48,518 INFO L226 Difference]: Without dead ends: 185
[2020-07-18 00:48:48,519 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182
[2020-07-18 00:48:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states.
[2020-07-18 00:48:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177.
[2020-07-18 00:48:48,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:48,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 177 states.
[2020-07-18 00:48:48,780 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 177 states.
[2020-07-18 00:48:48,780 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 177 states.
[2020-07-18 00:48:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:48,786 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions.
[2020-07-18 00:48:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions.
[2020-07-18 00:48:48,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:48,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:48,787 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 185 states.
[2020-07-18 00:48:48,787 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 185 states.
[2020-07-18 00:48:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:48,794 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions.
[2020-07-18 00:48:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions.
[2020-07-18 00:48:48,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:48,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:48,796 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:48,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states.
[2020-07-18 00:48:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions.
[2020-07-18 00:48:48,802 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 65
[2020-07-18 00:48:48,802 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:48,802 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions.
[2020-07-18 00:48:48,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-07-18 00:48:48,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 177 states and 205 transitions.
[2020-07-18 00:48:49,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions.
[2020-07-18 00:48:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2020-07-18 00:48:49,073 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:49,074 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:49,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-07-18 00:48:49,074 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:49,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:49,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1510377470, now seen corresponding path program 1 times
[2020-07-18 00:48:49,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:49,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1910833464]
[2020-07-18 00:48:49,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:49,287 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} assume true; {9411#true} is VALID
[2020-07-18 00:48:49,287 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9411#true} {9411#true} #144#return; {9411#true} is VALID
[2020-07-18 00:48:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:49,291 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID
[2020-07-18 00:48:49,291 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID
[2020-07-18 00:48:49,291 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID
[2020-07-18 00:48:49,292 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:49,297 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID
[2020-07-18 00:48:49,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID
[2020-07-18 00:48:49,297 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID
[2020-07-18 00:48:49,298 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:49,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID
[2020-07-18 00:48:49,303 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID
[2020-07-18 00:48:49,304 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID
[2020-07-18 00:48:49,304 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:49,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID
[2020-07-18 00:48:49,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID
[2020-07-18 00:48:49,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID
[2020-07-18 00:48:49,312 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:49,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID
[2020-07-18 00:48:49,321 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID
[2020-07-18 00:48:49,321 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID
[2020-07-18 00:48:49,323 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9417#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,323 INFO L263 TraceCheckUtils]: 0: Hoare triple {9411#true} call ULTIMATE.init(); {9411#true} is VALID
[2020-07-18 00:48:49,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume true; {9411#true} is VALID
[2020-07-18 00:48:49,323 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9411#true} {9411#true} #144#return; {9411#true} is VALID
[2020-07-18 00:48:49,323 INFO L263 TraceCheckUtils]: 3: Hoare triple {9411#true} call #t~ret10 := main(); {9411#true} is VALID
[2020-07-18 00:48:49,324 INFO L280 TraceCheckUtils]: 4: Hoare triple {9411#true} havoc ~tagbuf_len~0; {9411#true} is VALID
[2020-07-18 00:48:49,324 INFO L280 TraceCheckUtils]: 5: Hoare triple {9411#true} havoc ~t~0; {9411#true} is VALID
[2020-07-18 00:48:49,324 INFO L280 TraceCheckUtils]: 6: Hoare triple {9411#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9411#true} is VALID
[2020-07-18 00:48:49,324 INFO L280 TraceCheckUtils]: 7: Hoare triple {9411#true} ~tagbuf_len~0 := #t~nondet0; {9411#true} is VALID
[2020-07-18 00:48:49,324 INFO L280 TraceCheckUtils]: 8: Hoare triple {9411#true} havoc #t~nondet0; {9411#true} is VALID
[2020-07-18 00:48:49,325 INFO L280 TraceCheckUtils]: 9: Hoare triple {9411#true} assume ~tagbuf_len~0 >= 1; {9415#(<= 1 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,325 INFO L280 TraceCheckUtils]: 10: Hoare triple {9415#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,326 INFO L280 TraceCheckUtils]: 11: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,327 INFO L280 TraceCheckUtils]: 12: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,327 INFO L280 TraceCheckUtils]: 13: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,328 INFO L280 TraceCheckUtils]: 14: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,328 INFO L280 TraceCheckUtils]: 15: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,329 INFO L280 TraceCheckUtils]: 16: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,329 INFO L280 TraceCheckUtils]: 17: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,330 INFO L280 TraceCheckUtils]: 18: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,330 INFO L263 TraceCheckUtils]: 19: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {9411#true} is VALID
[2020-07-18 00:48:49,330 INFO L280 TraceCheckUtils]: 20: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID
[2020-07-18 00:48:49,330 INFO L280 TraceCheckUtils]: 21: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID
[2020-07-18 00:48:49,331 INFO L280 TraceCheckUtils]: 22: Hoare triple {9411#true} assume true; {9411#true} is VALID
[2020-07-18 00:48:49,331 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,331 INFO L263 TraceCheckUtils]: 24: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {9411#true} is VALID
[2020-07-18 00:48:49,332 INFO L280 TraceCheckUtils]: 25: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID
[2020-07-18 00:48:49,332 INFO L280 TraceCheckUtils]: 26: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID
[2020-07-18 00:48:49,332 INFO L280 TraceCheckUtils]: 27: Hoare triple {9411#true} assume true; {9411#true} is VALID
[2020-07-18 00:48:49,333 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,333 INFO L280 TraceCheckUtils]: 29: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {9426#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,334 INFO L280 TraceCheckUtils]: 30: Hoare triple {9426#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,335 INFO L280 TraceCheckUtils]: 31: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,335 INFO L280 TraceCheckUtils]: 32: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,336 INFO L280 TraceCheckUtils]: 33: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,336 INFO L280 TraceCheckUtils]: 34: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,337 INFO L280 TraceCheckUtils]: 35: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,337 INFO L280 TraceCheckUtils]: 36: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,338 INFO L263 TraceCheckUtils]: 37: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {9411#true} is VALID
[2020-07-18 00:48:49,338 INFO L280 TraceCheckUtils]: 38: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID
[2020-07-18 00:48:49,338 INFO L280 TraceCheckUtils]: 39: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID
[2020-07-18 00:48:49,338 INFO L280 TraceCheckUtils]: 40: Hoare triple {9411#true} assume true; {9411#true} is VALID
[2020-07-18 00:48:49,339 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,339 INFO L263 TraceCheckUtils]: 42: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {9411#true} is VALID
[2020-07-18 00:48:49,339 INFO L280 TraceCheckUtils]: 43: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID
[2020-07-18 00:48:49,340 INFO L280 TraceCheckUtils]: 44: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID
[2020-07-18 00:48:49,340 INFO L280 TraceCheckUtils]: 45: Hoare triple {9411#true} assume true; {9411#true} is VALID
[2020-07-18 00:48:49,340 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,341 INFO L280 TraceCheckUtils]: 47: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {9435#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,342 INFO L280 TraceCheckUtils]: 48: Hoare triple {9435#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,342 INFO L280 TraceCheckUtils]: 49: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,343 INFO L280 TraceCheckUtils]: 50: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,343 INFO L280 TraceCheckUtils]: 51: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,344 INFO L280 TraceCheckUtils]: 52: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,344 INFO L280 TraceCheckUtils]: 53: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet5; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,345 INFO L280 TraceCheckUtils]: 54: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet5; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,345 INFO L280 TraceCheckUtils]: 55: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,346 INFO L280 TraceCheckUtils]: 56: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,346 INFO L280 TraceCheckUtils]: 57: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet6; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,347 INFO L263 TraceCheckUtils]: 58: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {9411#true} is VALID
[2020-07-18 00:48:49,347 INFO L280 TraceCheckUtils]: 59: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID
[2020-07-18 00:48:49,347 INFO L280 TraceCheckUtils]: 60: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID
[2020-07-18 00:48:49,347 INFO L280 TraceCheckUtils]: 61: Hoare triple {9411#true} assume true; {9411#true} is VALID
[2020-07-18 00:48:49,348 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {9411#true} {9417#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:49,348 INFO L263 TraceCheckUtils]: 63: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {9440#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:49,349 INFO L280 TraceCheckUtils]: 64: Hoare triple {9440#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {9441#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:49,350 INFO L280 TraceCheckUtils]: 65: Hoare triple {9441#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {9412#false} is VALID
[2020-07-18 00:48:49,351 INFO L280 TraceCheckUtils]: 66: Hoare triple {9412#false} assume !false; {9412#false} is VALID
[2020-07-18 00:48:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:49,355 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:49,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1910833464]
[2020-07-18 00:48:49,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:49,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-07-18 00:48:49,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055283420]
[2020-07-18 00:48:49,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67
[2020-07-18 00:48:49,358 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:49,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states.
[2020-07-18 00:48:49,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:49,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-07-18 00:48:49,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:49,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-07-18 00:48:49,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2020-07-18 00:48:49,412 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand 9 states.
[2020-07-18 00:48:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:50,439 INFO L93 Difference]: Finished difference Result 192 states and 221 transitions.
[2020-07-18 00:48:50,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2020-07-18 00:48:50,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67
[2020-07-18 00:48:50,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:50,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-18 00:48:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions.
[2020-07-18 00:48:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-18 00:48:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions.
[2020-07-18 00:48:50,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 112 transitions.
[2020-07-18 00:48:50,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:50,572 INFO L225 Difference]: With dead ends: 192
[2020-07-18 00:48:50,573 INFO L226 Difference]: Without dead ends: 187
[2020-07-18 00:48:50,574 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210
[2020-07-18 00:48:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states.
[2020-07-18 00:48:50,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 181.
[2020-07-18 00:48:50,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:50,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 181 states.
[2020-07-18 00:48:50,825 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 181 states.
[2020-07-18 00:48:50,825 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 181 states.
[2020-07-18 00:48:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:50,832 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions.
[2020-07-18 00:48:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions.
[2020-07-18 00:48:50,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:50,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:50,834 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 187 states.
[2020-07-18 00:48:50,834 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 187 states.
[2020-07-18 00:48:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:50,840 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions.
[2020-07-18 00:48:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions.
[2020-07-18 00:48:50,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:50,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:50,841 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:50,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states.
[2020-07-18 00:48:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions.
[2020-07-18 00:48:50,846 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 67
[2020-07-18 00:48:50,846 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:50,846 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions.
[2020-07-18 00:48:50,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-07-18 00:48:50,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 181 states and 208 transitions.
[2020-07-18 00:48:51,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:51,112 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions.
[2020-07-18 00:48:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2020-07-18 00:48:51,114 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:51,114 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:51,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-07-18 00:48:51,114 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:51,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:51,115 INFO L82 PathProgramCache]: Analyzing trace with hash 869213219, now seen corresponding path program 2 times
[2020-07-18 00:48:51,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:51,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188697373]
[2020-07-18 00:48:51,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:51,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} assume true; {10576#true} is VALID
[2020-07-18 00:48:51,252 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {10576#true} {10576#true} #144#return; {10576#true} is VALID
[2020-07-18 00:48:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:51,261 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID
[2020-07-18 00:48:51,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID
[2020-07-18 00:48:51,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID
[2020-07-18 00:48:51,262 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:51,272 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID
[2020-07-18 00:48:51,273 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID
[2020-07-18 00:48:51,273 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID
[2020-07-18 00:48:51,274 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:51,278 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID
[2020-07-18 00:48:51,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID
[2020-07-18 00:48:51,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID
[2020-07-18 00:48:51,279 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:51,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID
[2020-07-18 00:48:51,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID
[2020-07-18 00:48:51,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID
[2020-07-18 00:48:51,295 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:51,300 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID
[2020-07-18 00:48:51,300 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID
[2020-07-18 00:48:51,300 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID
[2020-07-18 00:48:51,301 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10582#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,302 INFO L263 TraceCheckUtils]: 0: Hoare triple {10576#true} call ULTIMATE.init(); {10576#true} is VALID
[2020-07-18 00:48:51,302 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume true; {10576#true} is VALID
[2020-07-18 00:48:51,302 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10576#true} {10576#true} #144#return; {10576#true} is VALID
[2020-07-18 00:48:51,302 INFO L263 TraceCheckUtils]: 3: Hoare triple {10576#true} call #t~ret10 := main(); {10576#true} is VALID
[2020-07-18 00:48:51,302 INFO L280 TraceCheckUtils]: 4: Hoare triple {10576#true} havoc ~tagbuf_len~0; {10576#true} is VALID
[2020-07-18 00:48:51,302 INFO L280 TraceCheckUtils]: 5: Hoare triple {10576#true} havoc ~t~0; {10576#true} is VALID
[2020-07-18 00:48:51,303 INFO L280 TraceCheckUtils]: 6: Hoare triple {10576#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {10576#true} is VALID
[2020-07-18 00:48:51,303 INFO L280 TraceCheckUtils]: 7: Hoare triple {10576#true} ~tagbuf_len~0 := #t~nondet0; {10576#true} is VALID
[2020-07-18 00:48:51,303 INFO L280 TraceCheckUtils]: 8: Hoare triple {10576#true} havoc #t~nondet0; {10576#true} is VALID
[2020-07-18 00:48:51,304 INFO L280 TraceCheckUtils]: 9: Hoare triple {10576#true} assume ~tagbuf_len~0 >= 1; {10580#(<= 1 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,304 INFO L280 TraceCheckUtils]: 10: Hoare triple {10580#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,305 INFO L280 TraceCheckUtils]: 11: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,306 INFO L280 TraceCheckUtils]: 12: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,306 INFO L280 TraceCheckUtils]: 13: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,307 INFO L280 TraceCheckUtils]: 14: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,307 INFO L280 TraceCheckUtils]: 15: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,308 INFO L280 TraceCheckUtils]: 16: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,308 INFO L280 TraceCheckUtils]: 17: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,309 INFO L280 TraceCheckUtils]: 18: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,309 INFO L263 TraceCheckUtils]: 19: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {10576#true} is VALID
[2020-07-18 00:48:51,309 INFO L280 TraceCheckUtils]: 20: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID
[2020-07-18 00:48:51,310 INFO L280 TraceCheckUtils]: 21: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID
[2020-07-18 00:48:51,310 INFO L280 TraceCheckUtils]: 22: Hoare triple {10576#true} assume true; {10576#true} is VALID
[2020-07-18 00:48:51,311 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,311 INFO L263 TraceCheckUtils]: 24: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {10576#true} is VALID
[2020-07-18 00:48:51,311 INFO L280 TraceCheckUtils]: 25: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID
[2020-07-18 00:48:51,311 INFO L280 TraceCheckUtils]: 26: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID
[2020-07-18 00:48:51,311 INFO L280 TraceCheckUtils]: 27: Hoare triple {10576#true} assume true; {10576#true} is VALID
[2020-07-18 00:48:51,312 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,313 INFO L280 TraceCheckUtils]: 29: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {10591#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,314 INFO L280 TraceCheckUtils]: 30: Hoare triple {10591#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,314 INFO L280 TraceCheckUtils]: 31: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,315 INFO L280 TraceCheckUtils]: 32: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,316 INFO L280 TraceCheckUtils]: 33: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,316 INFO L280 TraceCheckUtils]: 34: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,317 INFO L280 TraceCheckUtils]: 35: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,317 INFO L280 TraceCheckUtils]: 36: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,318 INFO L280 TraceCheckUtils]: 37: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,319 INFO L280 TraceCheckUtils]: 38: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,319 INFO L280 TraceCheckUtils]: 39: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,319 INFO L263 TraceCheckUtils]: 40: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {10576#true} is VALID
[2020-07-18 00:48:51,320 INFO L280 TraceCheckUtils]: 41: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID
[2020-07-18 00:48:51,320 INFO L280 TraceCheckUtils]: 42: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID
[2020-07-18 00:48:51,320 INFO L280 TraceCheckUtils]: 43: Hoare triple {10576#true} assume true; {10576#true} is VALID
[2020-07-18 00:48:51,321 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,321 INFO L263 TraceCheckUtils]: 45: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {10576#true} is VALID
[2020-07-18 00:48:51,321 INFO L280 TraceCheckUtils]: 46: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID
[2020-07-18 00:48:51,321 INFO L280 TraceCheckUtils]: 47: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID
[2020-07-18 00:48:51,322 INFO L280 TraceCheckUtils]: 48: Hoare triple {10576#true} assume true; {10576#true} is VALID
[2020-07-18 00:48:51,322 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,323 INFO L280 TraceCheckUtils]: 50: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post9 := ~t~0; {10600#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,325 INFO L280 TraceCheckUtils]: 51: Hoare triple {10600#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post9; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,325 INFO L280 TraceCheckUtils]: 52: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post9; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,326 INFO L280 TraceCheckUtils]: 53: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,327 INFO L280 TraceCheckUtils]: 54: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,327 INFO L280 TraceCheckUtils]: 55: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,328 INFO L280 TraceCheckUtils]: 56: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet5; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,329 INFO L280 TraceCheckUtils]: 57: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet5; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,329 INFO L280 TraceCheckUtils]: 58: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,330 INFO L280 TraceCheckUtils]: 59: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,330 INFO L280 TraceCheckUtils]: 60: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet6; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,331 INFO L263 TraceCheckUtils]: 61: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {10576#true} is VALID
[2020-07-18 00:48:51,331 INFO L280 TraceCheckUtils]: 62: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID
[2020-07-18 00:48:51,331 INFO L280 TraceCheckUtils]: 63: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID
[2020-07-18 00:48:51,331 INFO L280 TraceCheckUtils]: 64: Hoare triple {10576#true} assume true; {10576#true} is VALID
[2020-07-18 00:48:51,332 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {10576#true} {10582#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:48:51,333 INFO L263 TraceCheckUtils]: 66: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {10605#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:51,333 INFO L280 TraceCheckUtils]: 67: Hoare triple {10605#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {10606#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:51,334 INFO L280 TraceCheckUtils]: 68: Hoare triple {10606#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {10577#false} is VALID
[2020-07-18 00:48:51,334 INFO L280 TraceCheckUtils]: 69: Hoare triple {10577#false} assume !false; {10577#false} is VALID
[2020-07-18 00:48:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:51,339 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:51,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188697373]
[2020-07-18 00:48:51,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:51,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-07-18 00:48:51,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020862228]
[2020-07-18 00:48:51,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70
[2020-07-18 00:48:51,341 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:51,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states.
[2020-07-18 00:48:51,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:51,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-07-18 00:48:51,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:51,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-07-18 00:48:51,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2020-07-18 00:48:51,411 INFO L87 Difference]: Start difference. First operand 181 states and 208 transitions. Second operand 9 states.
[2020-07-18 00:48:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:52,527 INFO L93 Difference]: Finished difference Result 193 states and 220 transitions.
[2020-07-18 00:48:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2020-07-18 00:48:52,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70
[2020-07-18 00:48:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-18 00:48:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions.
[2020-07-18 00:48:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-18 00:48:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions.
[2020-07-18 00:48:52,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 133 transitions.
[2020-07-18 00:48:52,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:52,674 INFO L225 Difference]: With dead ends: 193
[2020-07-18 00:48:52,674 INFO L226 Difference]: Without dead ends: 188
[2020-07-18 00:48:52,675 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210
[2020-07-18 00:48:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states.
[2020-07-18 00:48:52,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184.
[2020-07-18 00:48:52,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:52,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 184 states.
[2020-07-18 00:48:52,920 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 184 states.
[2020-07-18 00:48:52,920 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 184 states.
[2020-07-18 00:48:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:52,924 INFO L93 Difference]: Finished difference Result 188 states and 213 transitions.
[2020-07-18 00:48:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions.
[2020-07-18 00:48:52,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:52,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:52,925 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 188 states.
[2020-07-18 00:48:52,926 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 188 states.
[2020-07-18 00:48:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:52,931 INFO L93 Difference]: Finished difference Result 188 states and 213 transitions.
[2020-07-18 00:48:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions.
[2020-07-18 00:48:52,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:52,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:52,932 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:52,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states.
[2020-07-18 00:48:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 209 transitions.
[2020-07-18 00:48:52,937 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 209 transitions. Word has length 70
[2020-07-18 00:48:52,937 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:52,937 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 209 transitions.
[2020-07-18 00:48:52,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-07-18 00:48:52,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 184 states and 209 transitions.
[2020-07-18 00:48:53,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 209 transitions.
[2020-07-18 00:48:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2020-07-18 00:48:53,175 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:53,175 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:53,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-07-18 00:48:53,176 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:53,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:53,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1269119089, now seen corresponding path program 1 times
[2020-07-18 00:48:53,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:53,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [123781423]
[2020-07-18 00:48:53,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:53,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,321 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {11751#true} {11751#true} #144#return; {11751#true} is VALID
[2020-07-18 00:48:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:53,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID
[2020-07-18 00:48:53,327 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID
[2020-07-18 00:48:53,327 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,328 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11755#(<= 0 main_~t~0)} #152#return; {11755#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:53,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID
[2020-07-18 00:48:53,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID
[2020-07-18 00:48:53,334 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,335 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11755#(<= 0 main_~t~0)} #154#return; {11755#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:53,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID
[2020-07-18 00:48:53,340 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID
[2020-07-18 00:48:53,341 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,341 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11765#(<= 1 main_~t~0)} #156#return; {11765#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:53,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID
[2020-07-18 00:48:53,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID
[2020-07-18 00:48:53,346 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,347 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11765#(<= 1 main_~t~0)} #158#return; {11765#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:53,351 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID
[2020-07-18 00:48:53,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID
[2020-07-18 00:48:53,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,352 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11775#(<= 2 main_~t~0)} #164#return; {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:53,356 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID
[2020-07-18 00:48:53,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID
[2020-07-18 00:48:53,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,357 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11775#(<= 2 main_~t~0)} #166#return; {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,357 INFO L263 TraceCheckUtils]: 0: Hoare triple {11751#true} call ULTIMATE.init(); {11751#true} is VALID
[2020-07-18 00:48:53,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,357 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11751#true} {11751#true} #144#return; {11751#true} is VALID
[2020-07-18 00:48:53,358 INFO L263 TraceCheckUtils]: 3: Hoare triple {11751#true} call #t~ret10 := main(); {11751#true} is VALID
[2020-07-18 00:48:53,358 INFO L280 TraceCheckUtils]: 4: Hoare triple {11751#true} havoc ~tagbuf_len~0; {11751#true} is VALID
[2020-07-18 00:48:53,358 INFO L280 TraceCheckUtils]: 5: Hoare triple {11751#true} havoc ~t~0; {11751#true} is VALID
[2020-07-18 00:48:53,358 INFO L280 TraceCheckUtils]: 6: Hoare triple {11751#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {11751#true} is VALID
[2020-07-18 00:48:53,358 INFO L280 TraceCheckUtils]: 7: Hoare triple {11751#true} ~tagbuf_len~0 := #t~nondet0; {11751#true} is VALID
[2020-07-18 00:48:53,359 INFO L280 TraceCheckUtils]: 8: Hoare triple {11751#true} havoc #t~nondet0; {11751#true} is VALID
[2020-07-18 00:48:53,359 INFO L280 TraceCheckUtils]: 9: Hoare triple {11751#true} assume ~tagbuf_len~0 >= 1; {11751#true} is VALID
[2020-07-18 00:48:53,359 INFO L280 TraceCheckUtils]: 10: Hoare triple {11751#true} ~t~0 := 0; {11755#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:53,360 INFO L280 TraceCheckUtils]: 11: Hoare triple {11755#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {11755#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:53,360 INFO L280 TraceCheckUtils]: 12: Hoare triple {11755#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {11755#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:53,361 INFO L280 TraceCheckUtils]: 13: Hoare triple {11755#(<= 0 main_~t~0)} havoc #t~pre1; {11755#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:53,361 INFO L280 TraceCheckUtils]: 14: Hoare triple {11755#(<= 0 main_~t~0)} assume !false; {11755#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:53,362 INFO L280 TraceCheckUtils]: 15: Hoare triple {11755#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {11755#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:53,362 INFO L280 TraceCheckUtils]: 16: Hoare triple {11755#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {11755#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:53,362 INFO L280 TraceCheckUtils]: 17: Hoare triple {11755#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {11755#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:53,363 INFO L280 TraceCheckUtils]: 18: Hoare triple {11755#(<= 0 main_~t~0)} havoc #t~nondet2; {11755#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:53,363 INFO L263 TraceCheckUtils]: 19: Hoare triple {11755#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {11751#true} is VALID
[2020-07-18 00:48:53,363 INFO L280 TraceCheckUtils]: 20: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID
[2020-07-18 00:48:53,363 INFO L280 TraceCheckUtils]: 21: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID
[2020-07-18 00:48:53,363 INFO L280 TraceCheckUtils]: 22: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,364 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {11751#true} {11755#(<= 0 main_~t~0)} #152#return; {11755#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:53,364 INFO L263 TraceCheckUtils]: 24: Hoare triple {11755#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {11751#true} is VALID
[2020-07-18 00:48:53,364 INFO L280 TraceCheckUtils]: 25: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID
[2020-07-18 00:48:53,364 INFO L280 TraceCheckUtils]: 26: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID
[2020-07-18 00:48:53,364 INFO L280 TraceCheckUtils]: 27: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,365 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {11751#true} {11755#(<= 0 main_~t~0)} #154#return; {11755#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:53,365 INFO L280 TraceCheckUtils]: 29: Hoare triple {11755#(<= 0 main_~t~0)} #t~post3 := ~t~0; {11764#(<= 0 |main_#t~post3|)} is VALID
[2020-07-18 00:48:53,366 INFO L280 TraceCheckUtils]: 30: Hoare triple {11764#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {11765#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:53,366 INFO L280 TraceCheckUtils]: 31: Hoare triple {11765#(<= 1 main_~t~0)} havoc #t~post3; {11765#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:53,367 INFO L280 TraceCheckUtils]: 32: Hoare triple {11765#(<= 1 main_~t~0)} assume !false; {11765#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:53,367 INFO L280 TraceCheckUtils]: 33: Hoare triple {11765#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {11765#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:53,367 INFO L280 TraceCheckUtils]: 34: Hoare triple {11765#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {11765#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:53,368 INFO L280 TraceCheckUtils]: 35: Hoare triple {11765#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {11765#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:53,368 INFO L280 TraceCheckUtils]: 36: Hoare triple {11765#(<= 1 main_~t~0)} havoc #t~nondet2; {11765#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:53,368 INFO L263 TraceCheckUtils]: 37: Hoare triple {11765#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {11751#true} is VALID
[2020-07-18 00:48:53,369 INFO L280 TraceCheckUtils]: 38: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID
[2020-07-18 00:48:53,369 INFO L280 TraceCheckUtils]: 39: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID
[2020-07-18 00:48:53,369 INFO L280 TraceCheckUtils]: 40: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,369 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {11751#true} {11765#(<= 1 main_~t~0)} #156#return; {11765#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:53,370 INFO L263 TraceCheckUtils]: 42: Hoare triple {11765#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {11751#true} is VALID
[2020-07-18 00:48:53,370 INFO L280 TraceCheckUtils]: 43: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID
[2020-07-18 00:48:53,370 INFO L280 TraceCheckUtils]: 44: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID
[2020-07-18 00:48:53,370 INFO L280 TraceCheckUtils]: 45: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,370 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {11751#true} {11765#(<= 1 main_~t~0)} #158#return; {11765#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:53,371 INFO L280 TraceCheckUtils]: 47: Hoare triple {11765#(<= 1 main_~t~0)} #t~post4 := ~t~0; {11774#(<= 1 |main_#t~post4|)} is VALID
[2020-07-18 00:48:53,372 INFO L280 TraceCheckUtils]: 48: Hoare triple {11774#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,372 INFO L280 TraceCheckUtils]: 49: Hoare triple {11775#(<= 2 main_~t~0)} havoc #t~post4; {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,372 INFO L280 TraceCheckUtils]: 50: Hoare triple {11775#(<= 2 main_~t~0)} assume !false; {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,373 INFO L280 TraceCheckUtils]: 51: Hoare triple {11775#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,373 INFO L280 TraceCheckUtils]: 52: Hoare triple {11775#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,374 INFO L280 TraceCheckUtils]: 53: Hoare triple {11775#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,374 INFO L280 TraceCheckUtils]: 54: Hoare triple {11775#(<= 2 main_~t~0)} havoc #t~nondet5; {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,374 INFO L280 TraceCheckUtils]: 55: Hoare triple {11775#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,375 INFO L280 TraceCheckUtils]: 56: Hoare triple {11775#(<= 2 main_~t~0)} assume 0 != #t~nondet6; {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,375 INFO L280 TraceCheckUtils]: 57: Hoare triple {11775#(<= 2 main_~t~0)} havoc #t~nondet6; {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,375 INFO L263 TraceCheckUtils]: 58: Hoare triple {11775#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {11751#true} is VALID
[2020-07-18 00:48:53,375 INFO L280 TraceCheckUtils]: 59: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID
[2020-07-18 00:48:53,376 INFO L280 TraceCheckUtils]: 60: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID
[2020-07-18 00:48:53,376 INFO L280 TraceCheckUtils]: 61: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,379 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {11751#true} {11775#(<= 2 main_~t~0)} #164#return; {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,379 INFO L263 TraceCheckUtils]: 63: Hoare triple {11775#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {11751#true} is VALID
[2020-07-18 00:48:53,379 INFO L280 TraceCheckUtils]: 64: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID
[2020-07-18 00:48:53,379 INFO L280 TraceCheckUtils]: 65: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID
[2020-07-18 00:48:53,379 INFO L280 TraceCheckUtils]: 66: Hoare triple {11751#true} assume true; {11751#true} is VALID
[2020-07-18 00:48:53,386 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {11751#true} {11775#(<= 2 main_~t~0)} #166#return; {11775#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:53,389 INFO L280 TraceCheckUtils]: 68: Hoare triple {11775#(<= 2 main_~t~0)} #t~post7 := ~t~0; {11784#(<= 2 |main_#t~post7|)} is VALID
[2020-07-18 00:48:53,389 INFO L280 TraceCheckUtils]: 69: Hoare triple {11784#(<= 2 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {11785#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:53,390 INFO L280 TraceCheckUtils]: 70: Hoare triple {11785#(<= 3 main_~t~0)} havoc #t~post7; {11785#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:53,390 INFO L280 TraceCheckUtils]: 71: Hoare triple {11785#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {11785#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:53,391 INFO L263 TraceCheckUtils]: 72: Hoare triple {11785#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {11786#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:53,392 INFO L280 TraceCheckUtils]: 73: Hoare triple {11786#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {11787#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:53,392 INFO L280 TraceCheckUtils]: 74: Hoare triple {11787#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {11752#false} is VALID
[2020-07-18 00:48:53,393 INFO L280 TraceCheckUtils]: 75: Hoare triple {11752#false} assume !false; {11752#false} is VALID
[2020-07-18 00:48:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:53,397 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:53,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [123781423]
[2020-07-18 00:48:53,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:53,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-07-18 00:48:53,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129024254]
[2020-07-18 00:48:53,398 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76
[2020-07-18 00:48:53,399 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:53,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states.
[2020-07-18 00:48:53,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:53,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-07-18 00:48:53,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:53,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-07-18 00:48:53,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2020-07-18 00:48:53,464 INFO L87 Difference]: Start difference. First operand 184 states and 209 transitions. Second operand 11 states.
[2020-07-18 00:48:55,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:55,186 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions.
[2020-07-18 00:48:55,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2020-07-18 00:48:55,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76
[2020-07-18 00:48:55,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-18 00:48:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions.
[2020-07-18 00:48:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-18 00:48:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions.
[2020-07-18 00:48:55,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 135 transitions.
[2020-07-18 00:48:55,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:55,404 INFO L225 Difference]: With dead ends: 202
[2020-07-18 00:48:55,404 INFO L226 Difference]: Without dead ends: 200
[2020-07-18 00:48:55,405 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306
[2020-07-18 00:48:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states.
[2020-07-18 00:48:55,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 193.
[2020-07-18 00:48:55,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:55,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 193 states.
[2020-07-18 00:48:55,778 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 193 states.
[2020-07-18 00:48:55,778 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 193 states.
[2020-07-18 00:48:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:55,787 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions.
[2020-07-18 00:48:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 226 transitions.
[2020-07-18 00:48:55,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:55,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:55,789 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 200 states.
[2020-07-18 00:48:55,789 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 200 states.
[2020-07-18 00:48:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:55,797 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions.
[2020-07-18 00:48:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 226 transitions.
[2020-07-18 00:48:55,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:55,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:55,799 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:55,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states.
[2020-07-18 00:48:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 218 transitions.
[2020-07-18 00:48:55,806 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 218 transitions. Word has length 76
[2020-07-18 00:48:55,807 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:55,807 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 218 transitions.
[2020-07-18 00:48:55,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-07-18 00:48:55,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 193 states and 218 transitions.
[2020-07-18 00:48:56,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions.
[2020-07-18 00:48:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2020-07-18 00:48:56,181 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:56,182 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:56,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-07-18 00:48:56,182 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:56,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1147260786, now seen corresponding path program 1 times
[2020-07-18 00:48:56,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:56,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [969186700]
[2020-07-18 00:48:56,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:56,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,349 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12994#true} {12994#true} #144#return; {12994#true} is VALID
[2020-07-18 00:48:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:56,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID
[2020-07-18 00:48:56,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID
[2020-07-18 00:48:56,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,354 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {12998#(<= 0 main_~t~0)} #156#return; {12998#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:56,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID
[2020-07-18 00:48:56,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID
[2020-07-18 00:48:56,360 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,361 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {12998#(<= 0 main_~t~0)} #158#return; {12998#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:56,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID
[2020-07-18 00:48:56,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID
[2020-07-18 00:48:56,366 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,367 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {13008#(<= 1 main_~t~0)} #172#return; {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:56,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID
[2020-07-18 00:48:56,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID
[2020-07-18 00:48:56,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,374 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {13008#(<= 1 main_~t~0)} #174#return; {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:56,378 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID
[2020-07-18 00:48:56,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID
[2020-07-18 00:48:56,379 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,380 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {13018#(<= 2 main_~t~0)} #164#return; {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:56,385 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID
[2020-07-18 00:48:56,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID
[2020-07-18 00:48:56,386 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,387 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {13018#(<= 2 main_~t~0)} #166#return; {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,387 INFO L263 TraceCheckUtils]: 0: Hoare triple {12994#true} call ULTIMATE.init(); {12994#true} is VALID
[2020-07-18 00:48:56,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,388 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12994#true} {12994#true} #144#return; {12994#true} is VALID
[2020-07-18 00:48:56,388 INFO L263 TraceCheckUtils]: 3: Hoare triple {12994#true} call #t~ret10 := main(); {12994#true} is VALID
[2020-07-18 00:48:56,388 INFO L280 TraceCheckUtils]: 4: Hoare triple {12994#true} havoc ~tagbuf_len~0; {12994#true} is VALID
[2020-07-18 00:48:56,389 INFO L280 TraceCheckUtils]: 5: Hoare triple {12994#true} havoc ~t~0; {12994#true} is VALID
[2020-07-18 00:48:56,389 INFO L280 TraceCheckUtils]: 6: Hoare triple {12994#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {12994#true} is VALID
[2020-07-18 00:48:56,389 INFO L280 TraceCheckUtils]: 7: Hoare triple {12994#true} ~tagbuf_len~0 := #t~nondet0; {12994#true} is VALID
[2020-07-18 00:48:56,390 INFO L280 TraceCheckUtils]: 8: Hoare triple {12994#true} havoc #t~nondet0; {12994#true} is VALID
[2020-07-18 00:48:56,390 INFO L280 TraceCheckUtils]: 9: Hoare triple {12994#true} assume ~tagbuf_len~0 >= 1; {12994#true} is VALID
[2020-07-18 00:48:56,391 INFO L280 TraceCheckUtils]: 10: Hoare triple {12994#true} ~t~0 := 0; {12998#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:56,392 INFO L280 TraceCheckUtils]: 11: Hoare triple {12998#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {12998#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:56,392 INFO L280 TraceCheckUtils]: 12: Hoare triple {12998#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {12998#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:56,393 INFO L280 TraceCheckUtils]: 13: Hoare triple {12998#(<= 0 main_~t~0)} havoc #t~pre1; {12998#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:56,394 INFO L280 TraceCheckUtils]: 14: Hoare triple {12998#(<= 0 main_~t~0)} assume !false; {12998#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:56,395 INFO L280 TraceCheckUtils]: 15: Hoare triple {12998#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {12998#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:56,395 INFO L280 TraceCheckUtils]: 16: Hoare triple {12998#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {12998#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:56,396 INFO L280 TraceCheckUtils]: 17: Hoare triple {12998#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {12998#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:56,397 INFO L280 TraceCheckUtils]: 18: Hoare triple {12998#(<= 0 main_~t~0)} havoc #t~nondet2; {12998#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:56,397 INFO L263 TraceCheckUtils]: 19: Hoare triple {12998#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {12994#true} is VALID
[2020-07-18 00:48:56,398 INFO L280 TraceCheckUtils]: 20: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID
[2020-07-18 00:48:56,398 INFO L280 TraceCheckUtils]: 21: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID
[2020-07-18 00:48:56,398 INFO L280 TraceCheckUtils]: 22: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,399 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {12994#true} {12998#(<= 0 main_~t~0)} #156#return; {12998#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:56,400 INFO L263 TraceCheckUtils]: 24: Hoare triple {12998#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {12994#true} is VALID
[2020-07-18 00:48:56,400 INFO L280 TraceCheckUtils]: 25: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID
[2020-07-18 00:48:56,400 INFO L280 TraceCheckUtils]: 26: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID
[2020-07-18 00:48:56,401 INFO L280 TraceCheckUtils]: 27: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,402 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {12994#true} {12998#(<= 0 main_~t~0)} #158#return; {12998#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:56,402 INFO L280 TraceCheckUtils]: 29: Hoare triple {12998#(<= 0 main_~t~0)} #t~post4 := ~t~0; {13007#(<= 0 |main_#t~post4|)} is VALID
[2020-07-18 00:48:56,403 INFO L280 TraceCheckUtils]: 30: Hoare triple {13007#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,404 INFO L280 TraceCheckUtils]: 31: Hoare triple {13008#(<= 1 main_~t~0)} havoc #t~post4; {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,405 INFO L280 TraceCheckUtils]: 32: Hoare triple {13008#(<= 1 main_~t~0)} assume !false; {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,406 INFO L280 TraceCheckUtils]: 33: Hoare triple {13008#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,407 INFO L280 TraceCheckUtils]: 34: Hoare triple {13008#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,407 INFO L280 TraceCheckUtils]: 35: Hoare triple {13008#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,408 INFO L280 TraceCheckUtils]: 36: Hoare triple {13008#(<= 1 main_~t~0)} havoc #t~nondet5; {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,409 INFO L280 TraceCheckUtils]: 37: Hoare triple {13008#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,411 INFO L280 TraceCheckUtils]: 38: Hoare triple {13008#(<= 1 main_~t~0)} assume !(0 != #t~nondet6); {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,411 INFO L280 TraceCheckUtils]: 39: Hoare triple {13008#(<= 1 main_~t~0)} havoc #t~nondet6; {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,412 INFO L263 TraceCheckUtils]: 40: Hoare triple {13008#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {12994#true} is VALID
[2020-07-18 00:48:56,412 INFO L280 TraceCheckUtils]: 41: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID
[2020-07-18 00:48:56,412 INFO L280 TraceCheckUtils]: 42: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID
[2020-07-18 00:48:56,413 INFO L280 TraceCheckUtils]: 43: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,414 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {12994#true} {13008#(<= 1 main_~t~0)} #172#return; {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,414 INFO L263 TraceCheckUtils]: 45: Hoare triple {13008#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {12994#true} is VALID
[2020-07-18 00:48:56,414 INFO L280 TraceCheckUtils]: 46: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID
[2020-07-18 00:48:56,415 INFO L280 TraceCheckUtils]: 47: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID
[2020-07-18 00:48:56,415 INFO L280 TraceCheckUtils]: 48: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,416 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {12994#true} {13008#(<= 1 main_~t~0)} #174#return; {13008#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:56,417 INFO L280 TraceCheckUtils]: 50: Hoare triple {13008#(<= 1 main_~t~0)} #t~post9 := ~t~0; {13017#(<= 1 |main_#t~post9|)} is VALID
[2020-07-18 00:48:56,418 INFO L280 TraceCheckUtils]: 51: Hoare triple {13017#(<= 1 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,419 INFO L280 TraceCheckUtils]: 52: Hoare triple {13018#(<= 2 main_~t~0)} havoc #t~post9; {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,420 INFO L280 TraceCheckUtils]: 53: Hoare triple {13018#(<= 2 main_~t~0)} assume !false; {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,421 INFO L280 TraceCheckUtils]: 54: Hoare triple {13018#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,421 INFO L280 TraceCheckUtils]: 55: Hoare triple {13018#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,422 INFO L280 TraceCheckUtils]: 56: Hoare triple {13018#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,423 INFO L280 TraceCheckUtils]: 57: Hoare triple {13018#(<= 2 main_~t~0)} havoc #t~nondet5; {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,424 INFO L280 TraceCheckUtils]: 58: Hoare triple {13018#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,425 INFO L280 TraceCheckUtils]: 59: Hoare triple {13018#(<= 2 main_~t~0)} assume 0 != #t~nondet6; {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,425 INFO L280 TraceCheckUtils]: 60: Hoare triple {13018#(<= 2 main_~t~0)} havoc #t~nondet6; {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,426 INFO L263 TraceCheckUtils]: 61: Hoare triple {13018#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {12994#true} is VALID
[2020-07-18 00:48:56,426 INFO L280 TraceCheckUtils]: 62: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID
[2020-07-18 00:48:56,426 INFO L280 TraceCheckUtils]: 63: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID
[2020-07-18 00:48:56,427 INFO L280 TraceCheckUtils]: 64: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,428 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {12994#true} {13018#(<= 2 main_~t~0)} #164#return; {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,428 INFO L263 TraceCheckUtils]: 66: Hoare triple {13018#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {12994#true} is VALID
[2020-07-18 00:48:56,428 INFO L280 TraceCheckUtils]: 67: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID
[2020-07-18 00:48:56,429 INFO L280 TraceCheckUtils]: 68: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID
[2020-07-18 00:48:56,429 INFO L280 TraceCheckUtils]: 69: Hoare triple {12994#true} assume true; {12994#true} is VALID
[2020-07-18 00:48:56,430 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {12994#true} {13018#(<= 2 main_~t~0)} #166#return; {13018#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:56,431 INFO L280 TraceCheckUtils]: 71: Hoare triple {13018#(<= 2 main_~t~0)} #t~post7 := ~t~0; {13027#(<= 2 |main_#t~post7|)} is VALID
[2020-07-18 00:48:56,432 INFO L280 TraceCheckUtils]: 72: Hoare triple {13027#(<= 2 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {13028#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:56,433 INFO L280 TraceCheckUtils]: 73: Hoare triple {13028#(<= 3 main_~t~0)} havoc #t~post7; {13028#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:56,433 INFO L280 TraceCheckUtils]: 74: Hoare triple {13028#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {13028#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:56,435 INFO L263 TraceCheckUtils]: 75: Hoare triple {13028#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {13029#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:56,436 INFO L280 TraceCheckUtils]: 76: Hoare triple {13029#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {13030#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:56,436 INFO L280 TraceCheckUtils]: 77: Hoare triple {13030#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {12995#false} is VALID
[2020-07-18 00:48:56,437 INFO L280 TraceCheckUtils]: 78: Hoare triple {12995#false} assume !false; {12995#false} is VALID
[2020-07-18 00:48:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:56,447 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:56,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [969186700]
[2020-07-18 00:48:56,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:56,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-07-18 00:48:56,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698056779]
[2020-07-18 00:48:56,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79
[2020-07-18 00:48:56,449 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:56,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states.
[2020-07-18 00:48:56,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:56,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-07-18 00:48:56,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:56,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-07-18 00:48:56,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2020-07-18 00:48:56,542 INFO L87 Difference]: Start difference. First operand 193 states and 218 transitions. Second operand 11 states.
[2020-07-18 00:48:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:58,060 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions.
[2020-07-18 00:48:58,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2020-07-18 00:48:58,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79
[2020-07-18 00:48:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:48:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-18 00:48:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions.
[2020-07-18 00:48:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-18 00:48:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions.
[2020-07-18 00:48:58,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 168 transitions.
[2020-07-18 00:48:58,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:58,268 INFO L225 Difference]: With dead ends: 234
[2020-07-18 00:48:58,269 INFO L226 Difference]: Without dead ends: 232
[2020-07-18 00:48:58,269 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342
[2020-07-18 00:48:58,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states.
[2020-07-18 00:48:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 223.
[2020-07-18 00:48:58,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:48:58,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand 223 states.
[2020-07-18 00:48:58,612 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 223 states.
[2020-07-18 00:48:58,612 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 223 states.
[2020-07-18 00:48:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:58,620 INFO L93 Difference]: Finished difference Result 232 states and 266 transitions.
[2020-07-18 00:48:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 266 transitions.
[2020-07-18 00:48:58,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:58,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:58,621 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 232 states.
[2020-07-18 00:48:58,622 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 232 states.
[2020-07-18 00:48:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:48:58,635 INFO L93 Difference]: Finished difference Result 232 states and 266 transitions.
[2020-07-18 00:48:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 266 transitions.
[2020-07-18 00:48:58,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:48:58,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:48:58,636 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:48:58,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:48:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states.
[2020-07-18 00:48:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 255 transitions.
[2020-07-18 00:48:58,641 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 255 transitions. Word has length 79
[2020-07-18 00:48:58,644 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:48:58,644 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 255 transitions.
[2020-07-18 00:48:58,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-07-18 00:48:58,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 223 states and 255 transitions.
[2020-07-18 00:48:58,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:58,984 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 255 transitions.
[2020-07-18 00:48:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2020-07-18 00:48:58,986 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:48:58,987 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:48:58,987 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-07-18 00:48:58,987 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:48:58,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:48:58,988 INFO L82 PathProgramCache]: Analyzing trace with hash 341113206, now seen corresponding path program 2 times
[2020-07-18 00:48:58,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:48:58,988 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [333612186]
[2020-07-18 00:48:58,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:48:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:59,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,120 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14427#true} {14427#true} #144#return; {14427#true} is VALID
[2020-07-18 00:48:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:59,123 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID
[2020-07-18 00:48:59,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID
[2020-07-18 00:48:59,124 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,124 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14431#(<= 0 main_~t~0)} #156#return; {14431#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:59,134 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID
[2020-07-18 00:48:59,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID
[2020-07-18 00:48:59,135 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,136 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14431#(<= 0 main_~t~0)} #158#return; {14431#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:59,140 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID
[2020-07-18 00:48:59,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID
[2020-07-18 00:48:59,141 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,142 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14441#(<= 1 main_~t~0)} #164#return; {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:59,146 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID
[2020-07-18 00:48:59,146 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID
[2020-07-18 00:48:59,147 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,148 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14441#(<= 1 main_~t~0)} #166#return; {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:59,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID
[2020-07-18 00:48:59,152 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID
[2020-07-18 00:48:59,152 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,153 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14451#(<= 2 main_~t~0)} #172#return; {14451#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:48:59,157 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID
[2020-07-18 00:48:59,158 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID
[2020-07-18 00:48:59,158 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,159 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14451#(<= 2 main_~t~0)} #174#return; {14451#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:59,159 INFO L263 TraceCheckUtils]: 0: Hoare triple {14427#true} call ULTIMATE.init(); {14427#true} is VALID
[2020-07-18 00:48:59,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,160 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14427#true} {14427#true} #144#return; {14427#true} is VALID
[2020-07-18 00:48:59,160 INFO L263 TraceCheckUtils]: 3: Hoare triple {14427#true} call #t~ret10 := main(); {14427#true} is VALID
[2020-07-18 00:48:59,160 INFO L280 TraceCheckUtils]: 4: Hoare triple {14427#true} havoc ~tagbuf_len~0; {14427#true} is VALID
[2020-07-18 00:48:59,160 INFO L280 TraceCheckUtils]: 5: Hoare triple {14427#true} havoc ~t~0; {14427#true} is VALID
[2020-07-18 00:48:59,161 INFO L280 TraceCheckUtils]: 6: Hoare triple {14427#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {14427#true} is VALID
[2020-07-18 00:48:59,161 INFO L280 TraceCheckUtils]: 7: Hoare triple {14427#true} ~tagbuf_len~0 := #t~nondet0; {14427#true} is VALID
[2020-07-18 00:48:59,161 INFO L280 TraceCheckUtils]: 8: Hoare triple {14427#true} havoc #t~nondet0; {14427#true} is VALID
[2020-07-18 00:48:59,161 INFO L280 TraceCheckUtils]: 9: Hoare triple {14427#true} assume ~tagbuf_len~0 >= 1; {14427#true} is VALID
[2020-07-18 00:48:59,162 INFO L280 TraceCheckUtils]: 10: Hoare triple {14427#true} ~t~0 := 0; {14431#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:59,163 INFO L280 TraceCheckUtils]: 11: Hoare triple {14431#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {14431#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:59,163 INFO L280 TraceCheckUtils]: 12: Hoare triple {14431#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {14431#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:59,164 INFO L280 TraceCheckUtils]: 13: Hoare triple {14431#(<= 0 main_~t~0)} havoc #t~pre1; {14431#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:59,164 INFO L280 TraceCheckUtils]: 14: Hoare triple {14431#(<= 0 main_~t~0)} assume !false; {14431#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:59,165 INFO L280 TraceCheckUtils]: 15: Hoare triple {14431#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {14431#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:59,166 INFO L280 TraceCheckUtils]: 16: Hoare triple {14431#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {14431#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:59,177 INFO L280 TraceCheckUtils]: 17: Hoare triple {14431#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {14431#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:59,180 INFO L280 TraceCheckUtils]: 18: Hoare triple {14431#(<= 0 main_~t~0)} havoc #t~nondet2; {14431#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:59,181 INFO L263 TraceCheckUtils]: 19: Hoare triple {14431#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {14427#true} is VALID
[2020-07-18 00:48:59,181 INFO L280 TraceCheckUtils]: 20: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID
[2020-07-18 00:48:59,181 INFO L280 TraceCheckUtils]: 21: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID
[2020-07-18 00:48:59,181 INFO L280 TraceCheckUtils]: 22: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,182 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {14427#true} {14431#(<= 0 main_~t~0)} #156#return; {14431#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:59,182 INFO L263 TraceCheckUtils]: 24: Hoare triple {14431#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {14427#true} is VALID
[2020-07-18 00:48:59,182 INFO L280 TraceCheckUtils]: 25: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID
[2020-07-18 00:48:59,182 INFO L280 TraceCheckUtils]: 26: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID
[2020-07-18 00:48:59,183 INFO L280 TraceCheckUtils]: 27: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,183 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {14427#true} {14431#(<= 0 main_~t~0)} #158#return; {14431#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:48:59,184 INFO L280 TraceCheckUtils]: 29: Hoare triple {14431#(<= 0 main_~t~0)} #t~post4 := ~t~0; {14440#(<= 0 |main_#t~post4|)} is VALID
[2020-07-18 00:48:59,185 INFO L280 TraceCheckUtils]: 30: Hoare triple {14440#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,185 INFO L280 TraceCheckUtils]: 31: Hoare triple {14441#(<= 1 main_~t~0)} havoc #t~post4; {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,186 INFO L280 TraceCheckUtils]: 32: Hoare triple {14441#(<= 1 main_~t~0)} assume !false; {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,186 INFO L280 TraceCheckUtils]: 33: Hoare triple {14441#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,187 INFO L280 TraceCheckUtils]: 34: Hoare triple {14441#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,187 INFO L280 TraceCheckUtils]: 35: Hoare triple {14441#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,188 INFO L280 TraceCheckUtils]: 36: Hoare triple {14441#(<= 1 main_~t~0)} havoc #t~nondet5; {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,188 INFO L280 TraceCheckUtils]: 37: Hoare triple {14441#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,189 INFO L280 TraceCheckUtils]: 38: Hoare triple {14441#(<= 1 main_~t~0)} assume 0 != #t~nondet6; {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,190 INFO L280 TraceCheckUtils]: 39: Hoare triple {14441#(<= 1 main_~t~0)} havoc #t~nondet6; {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,190 INFO L263 TraceCheckUtils]: 40: Hoare triple {14441#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {14427#true} is VALID
[2020-07-18 00:48:59,190 INFO L280 TraceCheckUtils]: 41: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID
[2020-07-18 00:48:59,190 INFO L280 TraceCheckUtils]: 42: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID
[2020-07-18 00:48:59,190 INFO L280 TraceCheckUtils]: 43: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,191 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {14427#true} {14441#(<= 1 main_~t~0)} #164#return; {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,191 INFO L263 TraceCheckUtils]: 45: Hoare triple {14441#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {14427#true} is VALID
[2020-07-18 00:48:59,191 INFO L280 TraceCheckUtils]: 46: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID
[2020-07-18 00:48:59,192 INFO L280 TraceCheckUtils]: 47: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID
[2020-07-18 00:48:59,192 INFO L280 TraceCheckUtils]: 48: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,192 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {14427#true} {14441#(<= 1 main_~t~0)} #166#return; {14441#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:48:59,193 INFO L280 TraceCheckUtils]: 50: Hoare triple {14441#(<= 1 main_~t~0)} #t~post7 := ~t~0; {14450#(<= 1 |main_#t~post7|)} is VALID
[2020-07-18 00:48:59,194 INFO L280 TraceCheckUtils]: 51: Hoare triple {14450#(<= 1 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {14451#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:59,194 INFO L280 TraceCheckUtils]: 52: Hoare triple {14451#(<= 2 main_~t~0)} havoc #t~post7; {14451#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:59,195 INFO L280 TraceCheckUtils]: 53: Hoare triple {14451#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {14451#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:59,195 INFO L263 TraceCheckUtils]: 54: Hoare triple {14451#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {14427#true} is VALID
[2020-07-18 00:48:59,195 INFO L280 TraceCheckUtils]: 55: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID
[2020-07-18 00:48:59,195 INFO L280 TraceCheckUtils]: 56: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID
[2020-07-18 00:48:59,196 INFO L280 TraceCheckUtils]: 57: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,196 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {14427#true} {14451#(<= 2 main_~t~0)} #172#return; {14451#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:59,196 INFO L263 TraceCheckUtils]: 59: Hoare triple {14451#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {14427#true} is VALID
[2020-07-18 00:48:59,197 INFO L280 TraceCheckUtils]: 60: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID
[2020-07-18 00:48:59,197 INFO L280 TraceCheckUtils]: 61: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID
[2020-07-18 00:48:59,197 INFO L280 TraceCheckUtils]: 62: Hoare triple {14427#true} assume true; {14427#true} is VALID
[2020-07-18 00:48:59,198 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {14427#true} {14451#(<= 2 main_~t~0)} #174#return; {14451#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:48:59,198 INFO L280 TraceCheckUtils]: 64: Hoare triple {14451#(<= 2 main_~t~0)} #t~post9 := ~t~0; {14460#(<= 2 |main_#t~post9|)} is VALID
[2020-07-18 00:48:59,199 INFO L280 TraceCheckUtils]: 65: Hoare triple {14460#(<= 2 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {14461#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:59,200 INFO L280 TraceCheckUtils]: 66: Hoare triple {14461#(<= 3 main_~t~0)} havoc #t~post9; {14461#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:59,200 INFO L280 TraceCheckUtils]: 67: Hoare triple {14461#(<= 3 main_~t~0)} assume !false; {14461#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:59,201 INFO L280 TraceCheckUtils]: 68: Hoare triple {14461#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {14461#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:59,201 INFO L280 TraceCheckUtils]: 69: Hoare triple {14461#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14461#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:59,202 INFO L280 TraceCheckUtils]: 70: Hoare triple {14461#(<= 3 main_~t~0)} assume 0 != #t~nondet5; {14461#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:59,202 INFO L280 TraceCheckUtils]: 71: Hoare triple {14461#(<= 3 main_~t~0)} havoc #t~nondet5; {14461#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:59,203 INFO L280 TraceCheckUtils]: 72: Hoare triple {14461#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {14461#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:59,203 INFO L280 TraceCheckUtils]: 73: Hoare triple {14461#(<= 3 main_~t~0)} assume !(0 != #t~nondet6); {14461#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:59,204 INFO L280 TraceCheckUtils]: 74: Hoare triple {14461#(<= 3 main_~t~0)} havoc #t~nondet6; {14461#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:48:59,205 INFO L263 TraceCheckUtils]: 75: Hoare triple {14461#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {14462#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:48:59,205 INFO L280 TraceCheckUtils]: 76: Hoare triple {14462#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {14463#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:48:59,206 INFO L280 TraceCheckUtils]: 77: Hoare triple {14463#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {14428#false} is VALID
[2020-07-18 00:48:59,206 INFO L280 TraceCheckUtils]: 78: Hoare triple {14428#false} assume !false; {14428#false} is VALID
[2020-07-18 00:48:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:48:59,211 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:48:59,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [333612186]
[2020-07-18 00:48:59,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:48:59,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-07-18 00:48:59,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300083413]
[2020-07-18 00:48:59,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79
[2020-07-18 00:48:59,212 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:48:59,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states.
[2020-07-18 00:48:59,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:48:59,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-07-18 00:48:59,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:48:59,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-07-18 00:48:59,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2020-07-18 00:48:59,291 INFO L87 Difference]: Start difference. First operand 223 states and 255 transitions. Second operand 11 states.
[2020-07-18 00:49:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:00,959 INFO L93 Difference]: Finished difference Result 264 states and 305 transitions.
[2020-07-18 00:49:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2020-07-18 00:49:00,960 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79
[2020-07-18 00:49:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:49:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-18 00:49:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions.
[2020-07-18 00:49:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-18 00:49:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions.
[2020-07-18 00:49:00,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 168 transitions.
[2020-07-18 00:49:01,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:01,227 INFO L225 Difference]: With dead ends: 264
[2020-07-18 00:49:01,227 INFO L226 Difference]: Without dead ends: 262
[2020-07-18 00:49:01,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342
[2020-07-18 00:49:01,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states.
[2020-07-18 00:49:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 223.
[2020-07-18 00:49:01,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:49:01,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand 223 states.
[2020-07-18 00:49:01,571 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand 223 states.
[2020-07-18 00:49:01,571 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 223 states.
[2020-07-18 00:49:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:01,578 INFO L93 Difference]: Finished difference Result 262 states and 303 transitions.
[2020-07-18 00:49:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 303 transitions.
[2020-07-18 00:49:01,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:01,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:01,580 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 262 states.
[2020-07-18 00:49:01,580 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 262 states.
[2020-07-18 00:49:01,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:01,587 INFO L93 Difference]: Finished difference Result 262 states and 303 transitions.
[2020-07-18 00:49:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 303 transitions.
[2020-07-18 00:49:01,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:01,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:01,588 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:49:01,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:49:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states.
[2020-07-18 00:49:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 255 transitions.
[2020-07-18 00:49:01,594 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 255 transitions. Word has length 79
[2020-07-18 00:49:01,594 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:49:01,594 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 255 transitions.
[2020-07-18 00:49:01,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-07-18 00:49:01,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 223 states and 255 transitions.
[2020-07-18 00:49:01,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 255 transitions.
[2020-07-18 00:49:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2020-07-18 00:49:01,983 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:49:01,983 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:49:01,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-07-18 00:49:01,984 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:49:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:49:01,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1759613834, now seen corresponding path program 1 times
[2020-07-18 00:49:01,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:49:01,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [60490359]
[2020-07-18 00:49:01,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:49:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:02,177 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,177 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {15980#true} {15980#true} #144#return; {15980#true} is VALID
[2020-07-18 00:49:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:02,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,180 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,181 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:02,190 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,192 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:02,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,203 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,204 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:02,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,212 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,213 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:02,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,220 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,221 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:02,225 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,225 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,225 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,226 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:02,229 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,230 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,231 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15986#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,231 INFO L263 TraceCheckUtils]: 0: Hoare triple {15980#true} call ULTIMATE.init(); {15980#true} is VALID
[2020-07-18 00:49:02,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,231 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {15980#true} {15980#true} #144#return; {15980#true} is VALID
[2020-07-18 00:49:02,231 INFO L263 TraceCheckUtils]: 3: Hoare triple {15980#true} call #t~ret10 := main(); {15980#true} is VALID
[2020-07-18 00:49:02,232 INFO L280 TraceCheckUtils]: 4: Hoare triple {15980#true} havoc ~tagbuf_len~0; {15980#true} is VALID
[2020-07-18 00:49:02,232 INFO L280 TraceCheckUtils]: 5: Hoare triple {15980#true} havoc ~t~0; {15980#true} is VALID
[2020-07-18 00:49:02,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {15980#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {15980#true} is VALID
[2020-07-18 00:49:02,232 INFO L280 TraceCheckUtils]: 7: Hoare triple {15980#true} ~tagbuf_len~0 := #t~nondet0; {15980#true} is VALID
[2020-07-18 00:49:02,232 INFO L280 TraceCheckUtils]: 8: Hoare triple {15980#true} havoc #t~nondet0; {15980#true} is VALID
[2020-07-18 00:49:02,233 INFO L280 TraceCheckUtils]: 9: Hoare triple {15980#true} assume ~tagbuf_len~0 >= 1; {15984#(<= 1 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,234 INFO L280 TraceCheckUtils]: 10: Hoare triple {15984#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,234 INFO L280 TraceCheckUtils]: 11: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,235 INFO L280 TraceCheckUtils]: 12: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,236 INFO L280 TraceCheckUtils]: 13: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,236 INFO L280 TraceCheckUtils]: 14: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,237 INFO L280 TraceCheckUtils]: 15: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,238 INFO L280 TraceCheckUtils]: 16: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,238 INFO L280 TraceCheckUtils]: 17: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,239 INFO L280 TraceCheckUtils]: 18: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,239 INFO L263 TraceCheckUtils]: 19: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {15980#true} is VALID
[2020-07-18 00:49:02,239 INFO L280 TraceCheckUtils]: 20: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,239 INFO L280 TraceCheckUtils]: 21: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,239 INFO L280 TraceCheckUtils]: 22: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,240 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,240 INFO L263 TraceCheckUtils]: 24: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {15980#true} is VALID
[2020-07-18 00:49:02,240 INFO L280 TraceCheckUtils]: 25: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,241 INFO L280 TraceCheckUtils]: 26: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,241 INFO L280 TraceCheckUtils]: 27: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,242 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,242 INFO L280 TraceCheckUtils]: 29: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {15995#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,243 INFO L280 TraceCheckUtils]: 30: Hoare triple {15995#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,244 INFO L280 TraceCheckUtils]: 31: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,244 INFO L280 TraceCheckUtils]: 32: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,245 INFO L280 TraceCheckUtils]: 33: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,246 INFO L280 TraceCheckUtils]: 34: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,247 INFO L280 TraceCheckUtils]: 35: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,247 INFO L280 TraceCheckUtils]: 36: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,248 INFO L263 TraceCheckUtils]: 37: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {15980#true} is VALID
[2020-07-18 00:49:02,248 INFO L280 TraceCheckUtils]: 38: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,248 INFO L280 TraceCheckUtils]: 39: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,248 INFO L280 TraceCheckUtils]: 40: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,249 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,250 INFO L263 TraceCheckUtils]: 42: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {15980#true} is VALID
[2020-07-18 00:49:02,250 INFO L280 TraceCheckUtils]: 43: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,250 INFO L280 TraceCheckUtils]: 44: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,250 INFO L280 TraceCheckUtils]: 45: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,251 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,252 INFO L280 TraceCheckUtils]: 47: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {16004#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,252 INFO L280 TraceCheckUtils]: 48: Hoare triple {16004#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,253 INFO L280 TraceCheckUtils]: 49: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,254 INFO L280 TraceCheckUtils]: 50: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,255 INFO L280 TraceCheckUtils]: 51: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,255 INFO L280 TraceCheckUtils]: 52: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,256 INFO L280 TraceCheckUtils]: 53: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,257 INFO L280 TraceCheckUtils]: 54: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,257 INFO L280 TraceCheckUtils]: 55: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,258 INFO L280 TraceCheckUtils]: 56: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet6; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,259 INFO L280 TraceCheckUtils]: 57: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,259 INFO L263 TraceCheckUtils]: 58: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {15980#true} is VALID
[2020-07-18 00:49:02,259 INFO L280 TraceCheckUtils]: 59: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,259 INFO L280 TraceCheckUtils]: 60: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,260 INFO L280 TraceCheckUtils]: 61: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,260 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,261 INFO L263 TraceCheckUtils]: 63: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {15980#true} is VALID
[2020-07-18 00:49:02,261 INFO L280 TraceCheckUtils]: 64: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,261 INFO L280 TraceCheckUtils]: 65: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,261 INFO L280 TraceCheckUtils]: 66: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,262 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,263 INFO L280 TraceCheckUtils]: 68: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post7 := ~t~0; {16013#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,264 INFO L280 TraceCheckUtils]: 69: Hoare triple {16013#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post7; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,265 INFO L280 TraceCheckUtils]: 70: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post7; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,266 INFO L280 TraceCheckUtils]: 71: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,266 INFO L263 TraceCheckUtils]: 72: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {15980#true} is VALID
[2020-07-18 00:49:02,266 INFO L280 TraceCheckUtils]: 73: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID
[2020-07-18 00:49:02,266 INFO L280 TraceCheckUtils]: 74: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID
[2020-07-18 00:49:02,266 INFO L280 TraceCheckUtils]: 75: Hoare triple {15980#true} assume true; {15980#true} is VALID
[2020-07-18 00:49:02,267 INFO L275 TraceCheckUtils]: 76: Hoare quadruple {15980#true} {15986#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:02,268 INFO L263 TraceCheckUtils]: 77: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {16018#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:49:02,269 INFO L280 TraceCheckUtils]: 78: Hoare triple {16018#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {16019#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:49:02,269 INFO L280 TraceCheckUtils]: 79: Hoare triple {16019#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {15981#false} is VALID
[2020-07-18 00:49:02,269 INFO L280 TraceCheckUtils]: 80: Hoare triple {15981#false} assume !false; {15981#false} is VALID
[2020-07-18 00:49:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:49:02,278 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:49:02,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [60490359]
[2020-07-18 00:49:02,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:49:02,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-07-18 00:49:02,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130076166]
[2020-07-18 00:49:02,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81
[2020-07-18 00:49:02,279 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:49:02,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states.
[2020-07-18 00:49:02,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:02,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-07-18 00:49:02,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:49:02,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-07-18 00:49:02,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2020-07-18 00:49:02,347 INFO L87 Difference]: Start difference. First operand 223 states and 255 transitions. Second operand 10 states.
[2020-07-18 00:49:03,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:03,727 INFO L93 Difference]: Finished difference Result 236 states and 268 transitions.
[2020-07-18 00:49:03,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2020-07-18 00:49:03,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81
[2020-07-18 00:49:03,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:49:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2020-07-18 00:49:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions.
[2020-07-18 00:49:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2020-07-18 00:49:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions.
[2020-07-18 00:49:03,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 109 transitions.
[2020-07-18 00:49:03,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:03,858 INFO L225 Difference]: With dead ends: 236
[2020-07-18 00:49:03,859 INFO L226 Difference]: Without dead ends: 234
[2020-07-18 00:49:03,859 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306
[2020-07-18 00:49:03,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states.
[2020-07-18 00:49:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228.
[2020-07-18 00:49:04,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:49:04,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 228 states.
[2020-07-18 00:49:04,194 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 228 states.
[2020-07-18 00:49:04,194 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 228 states.
[2020-07-18 00:49:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:04,199 INFO L93 Difference]: Finished difference Result 234 states and 266 transitions.
[2020-07-18 00:49:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 266 transitions.
[2020-07-18 00:49:04,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:04,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:04,200 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand 234 states.
[2020-07-18 00:49:04,200 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 234 states.
[2020-07-18 00:49:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:04,206 INFO L93 Difference]: Finished difference Result 234 states and 266 transitions.
[2020-07-18 00:49:04,206 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 266 transitions.
[2020-07-18 00:49:04,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:04,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:04,207 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:49:04,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:49:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states.
[2020-07-18 00:49:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 260 transitions.
[2020-07-18 00:49:04,212 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 260 transitions. Word has length 81
[2020-07-18 00:49:04,212 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:49:04,212 INFO L479 AbstractCegarLoop]: Abstraction has 228 states and 260 transitions.
[2020-07-18 00:49:04,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-07-18 00:49:04,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 228 states and 260 transitions.
[2020-07-18 00:49:04,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 260 transitions.
[2020-07-18 00:49:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2020-07-18 00:49:04,577 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:49:04,577 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:49:04,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-07-18 00:49:04,577 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:49:04,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:49:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash -343631243, now seen corresponding path program 1 times
[2020-07-18 00:49:04,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:49:04,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1693207242]
[2020-07-18 00:49:04,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:49:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:04,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,712 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17434#true} {17434#true} #144#return; {17434#true} is VALID
[2020-07-18 00:49:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:04,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID
[2020-07-18 00:49:04,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID
[2020-07-18 00:49:04,719 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,719 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17438#(<= 0 main_~t~0)} #152#return; {17438#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:04,729 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID
[2020-07-18 00:49:04,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID
[2020-07-18 00:49:04,730 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,730 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17438#(<= 0 main_~t~0)} #154#return; {17438#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:04,735 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID
[2020-07-18 00:49:04,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID
[2020-07-18 00:49:04,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,736 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17448#(<= 1 main_~t~0)} #156#return; {17448#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:04,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID
[2020-07-18 00:49:04,744 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID
[2020-07-18 00:49:04,744 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,745 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17448#(<= 1 main_~t~0)} #158#return; {17448#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:04,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID
[2020-07-18 00:49:04,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID
[2020-07-18 00:49:04,749 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,750 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17458#(<= 2 main_~t~0)} #172#return; {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:04,753 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID
[2020-07-18 00:49:04,753 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID
[2020-07-18 00:49:04,753 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,754 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17458#(<= 2 main_~t~0)} #174#return; {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,754 INFO L263 TraceCheckUtils]: 0: Hoare triple {17434#true} call ULTIMATE.init(); {17434#true} is VALID
[2020-07-18 00:49:04,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,755 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17434#true} {17434#true} #144#return; {17434#true} is VALID
[2020-07-18 00:49:04,755 INFO L263 TraceCheckUtils]: 3: Hoare triple {17434#true} call #t~ret10 := main(); {17434#true} is VALID
[2020-07-18 00:49:04,755 INFO L280 TraceCheckUtils]: 4: Hoare triple {17434#true} havoc ~tagbuf_len~0; {17434#true} is VALID
[2020-07-18 00:49:04,755 INFO L280 TraceCheckUtils]: 5: Hoare triple {17434#true} havoc ~t~0; {17434#true} is VALID
[2020-07-18 00:49:04,755 INFO L280 TraceCheckUtils]: 6: Hoare triple {17434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {17434#true} is VALID
[2020-07-18 00:49:04,755 INFO L280 TraceCheckUtils]: 7: Hoare triple {17434#true} ~tagbuf_len~0 := #t~nondet0; {17434#true} is VALID
[2020-07-18 00:49:04,756 INFO L280 TraceCheckUtils]: 8: Hoare triple {17434#true} havoc #t~nondet0; {17434#true} is VALID
[2020-07-18 00:49:04,756 INFO L280 TraceCheckUtils]: 9: Hoare triple {17434#true} assume ~tagbuf_len~0 >= 1; {17434#true} is VALID
[2020-07-18 00:49:04,756 INFO L280 TraceCheckUtils]: 10: Hoare triple {17434#true} ~t~0 := 0; {17438#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:04,756 INFO L280 TraceCheckUtils]: 11: Hoare triple {17438#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {17438#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:04,757 INFO L280 TraceCheckUtils]: 12: Hoare triple {17438#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {17438#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:04,757 INFO L280 TraceCheckUtils]: 13: Hoare triple {17438#(<= 0 main_~t~0)} havoc #t~pre1; {17438#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:04,758 INFO L280 TraceCheckUtils]: 14: Hoare triple {17438#(<= 0 main_~t~0)} assume !false; {17438#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:04,758 INFO L280 TraceCheckUtils]: 15: Hoare triple {17438#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {17438#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:04,758 INFO L280 TraceCheckUtils]: 16: Hoare triple {17438#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {17438#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:04,759 INFO L280 TraceCheckUtils]: 17: Hoare triple {17438#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {17438#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:04,759 INFO L280 TraceCheckUtils]: 18: Hoare triple {17438#(<= 0 main_~t~0)} havoc #t~nondet2; {17438#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:04,759 INFO L263 TraceCheckUtils]: 19: Hoare triple {17438#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {17434#true} is VALID
[2020-07-18 00:49:04,759 INFO L280 TraceCheckUtils]: 20: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID
[2020-07-18 00:49:04,759 INFO L280 TraceCheckUtils]: 21: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID
[2020-07-18 00:49:04,760 INFO L280 TraceCheckUtils]: 22: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,760 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {17434#true} {17438#(<= 0 main_~t~0)} #152#return; {17438#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:04,760 INFO L263 TraceCheckUtils]: 24: Hoare triple {17438#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {17434#true} is VALID
[2020-07-18 00:49:04,760 INFO L280 TraceCheckUtils]: 25: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID
[2020-07-18 00:49:04,760 INFO L280 TraceCheckUtils]: 26: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID
[2020-07-18 00:49:04,761 INFO L280 TraceCheckUtils]: 27: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,761 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {17434#true} {17438#(<= 0 main_~t~0)} #154#return; {17438#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:04,761 INFO L280 TraceCheckUtils]: 29: Hoare triple {17438#(<= 0 main_~t~0)} #t~post3 := ~t~0; {17447#(<= 0 |main_#t~post3|)} is VALID
[2020-07-18 00:49:04,762 INFO L280 TraceCheckUtils]: 30: Hoare triple {17447#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {17448#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:04,762 INFO L280 TraceCheckUtils]: 31: Hoare triple {17448#(<= 1 main_~t~0)} havoc #t~post3; {17448#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:04,763 INFO L280 TraceCheckUtils]: 32: Hoare triple {17448#(<= 1 main_~t~0)} assume !false; {17448#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:04,763 INFO L280 TraceCheckUtils]: 33: Hoare triple {17448#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {17448#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:04,764 INFO L280 TraceCheckUtils]: 34: Hoare triple {17448#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {17448#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:04,764 INFO L280 TraceCheckUtils]: 35: Hoare triple {17448#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {17448#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:04,765 INFO L280 TraceCheckUtils]: 36: Hoare triple {17448#(<= 1 main_~t~0)} havoc #t~nondet2; {17448#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:04,765 INFO L263 TraceCheckUtils]: 37: Hoare triple {17448#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {17434#true} is VALID
[2020-07-18 00:49:04,765 INFO L280 TraceCheckUtils]: 38: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID
[2020-07-18 00:49:04,765 INFO L280 TraceCheckUtils]: 39: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID
[2020-07-18 00:49:04,766 INFO L280 TraceCheckUtils]: 40: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,766 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {17434#true} {17448#(<= 1 main_~t~0)} #156#return; {17448#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:04,766 INFO L263 TraceCheckUtils]: 42: Hoare triple {17448#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {17434#true} is VALID
[2020-07-18 00:49:04,766 INFO L280 TraceCheckUtils]: 43: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID
[2020-07-18 00:49:04,766 INFO L280 TraceCheckUtils]: 44: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID
[2020-07-18 00:49:04,767 INFO L280 TraceCheckUtils]: 45: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,767 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {17434#true} {17448#(<= 1 main_~t~0)} #158#return; {17448#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:04,767 INFO L280 TraceCheckUtils]: 47: Hoare triple {17448#(<= 1 main_~t~0)} #t~post4 := ~t~0; {17457#(<= 1 |main_#t~post4|)} is VALID
[2020-07-18 00:49:04,768 INFO L280 TraceCheckUtils]: 48: Hoare triple {17457#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,768 INFO L280 TraceCheckUtils]: 49: Hoare triple {17458#(<= 2 main_~t~0)} havoc #t~post4; {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,769 INFO L280 TraceCheckUtils]: 50: Hoare triple {17458#(<= 2 main_~t~0)} assume !false; {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,769 INFO L280 TraceCheckUtils]: 51: Hoare triple {17458#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,770 INFO L280 TraceCheckUtils]: 52: Hoare triple {17458#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,770 INFO L280 TraceCheckUtils]: 53: Hoare triple {17458#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,770 INFO L280 TraceCheckUtils]: 54: Hoare triple {17458#(<= 2 main_~t~0)} havoc #t~nondet5; {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,771 INFO L280 TraceCheckUtils]: 55: Hoare triple {17458#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,771 INFO L280 TraceCheckUtils]: 56: Hoare triple {17458#(<= 2 main_~t~0)} assume !(0 != #t~nondet6); {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,771 INFO L280 TraceCheckUtils]: 57: Hoare triple {17458#(<= 2 main_~t~0)} havoc #t~nondet6; {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,771 INFO L263 TraceCheckUtils]: 58: Hoare triple {17458#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {17434#true} is VALID
[2020-07-18 00:49:04,772 INFO L280 TraceCheckUtils]: 59: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID
[2020-07-18 00:49:04,772 INFO L280 TraceCheckUtils]: 60: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID
[2020-07-18 00:49:04,772 INFO L280 TraceCheckUtils]: 61: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,772 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {17434#true} {17458#(<= 2 main_~t~0)} #172#return; {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,772 INFO L263 TraceCheckUtils]: 63: Hoare triple {17458#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {17434#true} is VALID
[2020-07-18 00:49:04,773 INFO L280 TraceCheckUtils]: 64: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID
[2020-07-18 00:49:04,773 INFO L280 TraceCheckUtils]: 65: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID
[2020-07-18 00:49:04,773 INFO L280 TraceCheckUtils]: 66: Hoare triple {17434#true} assume true; {17434#true} is VALID
[2020-07-18 00:49:04,773 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {17434#true} {17458#(<= 2 main_~t~0)} #174#return; {17458#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:04,778 INFO L280 TraceCheckUtils]: 68: Hoare triple {17458#(<= 2 main_~t~0)} #t~post9 := ~t~0; {17467#(<= 2 |main_#t~post9|)} is VALID
[2020-07-18 00:49:04,779 INFO L280 TraceCheckUtils]: 69: Hoare triple {17467#(<= 2 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {17468#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:04,780 INFO L280 TraceCheckUtils]: 70: Hoare triple {17468#(<= 3 main_~t~0)} havoc #t~post9; {17468#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:04,780 INFO L280 TraceCheckUtils]: 71: Hoare triple {17468#(<= 3 main_~t~0)} assume !false; {17468#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:04,781 INFO L280 TraceCheckUtils]: 72: Hoare triple {17468#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {17468#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:04,781 INFO L280 TraceCheckUtils]: 73: Hoare triple {17468#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {17468#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:04,782 INFO L280 TraceCheckUtils]: 74: Hoare triple {17468#(<= 3 main_~t~0)} assume 0 != #t~nondet5; {17468#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:04,782 INFO L280 TraceCheckUtils]: 75: Hoare triple {17468#(<= 3 main_~t~0)} havoc #t~nondet5; {17468#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:04,783 INFO L280 TraceCheckUtils]: 76: Hoare triple {17468#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {17468#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:04,783 INFO L280 TraceCheckUtils]: 77: Hoare triple {17468#(<= 3 main_~t~0)} assume !(0 != #t~nondet6); {17468#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:04,784 INFO L280 TraceCheckUtils]: 78: Hoare triple {17468#(<= 3 main_~t~0)} havoc #t~nondet6; {17468#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:04,785 INFO L263 TraceCheckUtils]: 79: Hoare triple {17468#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {17469#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:49:04,785 INFO L280 TraceCheckUtils]: 80: Hoare triple {17469#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {17470#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:49:04,786 INFO L280 TraceCheckUtils]: 81: Hoare triple {17470#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {17435#false} is VALID
[2020-07-18 00:49:04,786 INFO L280 TraceCheckUtils]: 82: Hoare triple {17435#false} assume !false; {17435#false} is VALID
[2020-07-18 00:49:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:49:04,791 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:49:04,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1693207242]
[2020-07-18 00:49:04,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:49:04,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-07-18 00:49:04,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074389830]
[2020-07-18 00:49:04,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83
[2020-07-18 00:49:04,792 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:49:04,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states.
[2020-07-18 00:49:04,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:04,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-07-18 00:49:04,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:49:04,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-07-18 00:49:04,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2020-07-18 00:49:04,869 INFO L87 Difference]: Start difference. First operand 228 states and 260 transitions. Second operand 11 states.
[2020-07-18 00:49:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:06,561 INFO L93 Difference]: Finished difference Result 263 states and 302 transitions.
[2020-07-18 00:49:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2020-07-18 00:49:06,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83
[2020-07-18 00:49:06,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:49:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-18 00:49:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 160 transitions.
[2020-07-18 00:49:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-18 00:49:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 160 transitions.
[2020-07-18 00:49:06,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 160 transitions.
[2020-07-18 00:49:06,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:06,751 INFO L225 Difference]: With dead ends: 263
[2020-07-18 00:49:06,751 INFO L226 Difference]: Without dead ends: 261
[2020-07-18 00:49:06,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306
[2020-07-18 00:49:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states.
[2020-07-18 00:49:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 253.
[2020-07-18 00:49:07,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:49:07,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand 253 states.
[2020-07-18 00:49:07,102 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand 253 states.
[2020-07-18 00:49:07,102 INFO L87 Difference]: Start difference. First operand 261 states. Second operand 253 states.
[2020-07-18 00:49:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:07,111 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions.
[2020-07-18 00:49:07,111 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 300 transitions.
[2020-07-18 00:49:07,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:07,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:07,113 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 261 states.
[2020-07-18 00:49:07,113 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 261 states.
[2020-07-18 00:49:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:07,120 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions.
[2020-07-18 00:49:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 300 transitions.
[2020-07-18 00:49:07,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:07,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:07,122 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:49:07,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:49:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states.
[2020-07-18 00:49:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 291 transitions.
[2020-07-18 00:49:07,129 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 291 transitions. Word has length 83
[2020-07-18 00:49:07,130 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:49:07,130 INFO L479 AbstractCegarLoop]: Abstraction has 253 states and 291 transitions.
[2020-07-18 00:49:07,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-07-18 00:49:07,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 253 states and 291 transitions.
[2020-07-18 00:49:07,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 291 transitions.
[2020-07-18 00:49:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2020-07-18 00:49:07,548 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:49:07,548 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:49:07,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-07-18 00:49:07,548 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:49:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:49:07,549 INFO L82 PathProgramCache]: Analyzing trace with hash -857748777, now seen corresponding path program 3 times
[2020-07-18 00:49:07,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:49:07,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1926788278]
[2020-07-18 00:49:07,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:49:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:07,734 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,735 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19041#true} {19041#true} #144#return; {19041#true} is VALID
[2020-07-18 00:49:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:07,743 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,743 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,745 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:07,749 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,750 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,751 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:07,756 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,756 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,757 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,758 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:07,765 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,766 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,766 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,767 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:07,772 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,772 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,773 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,774 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:07,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,779 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,779 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,780 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:07,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,786 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,787 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19047#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,787 INFO L263 TraceCheckUtils]: 0: Hoare triple {19041#true} call ULTIMATE.init(); {19041#true} is VALID
[2020-07-18 00:49:07,788 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,788 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19041#true} {19041#true} #144#return; {19041#true} is VALID
[2020-07-18 00:49:07,788 INFO L263 TraceCheckUtils]: 3: Hoare triple {19041#true} call #t~ret10 := main(); {19041#true} is VALID
[2020-07-18 00:49:07,789 INFO L280 TraceCheckUtils]: 4: Hoare triple {19041#true} havoc ~tagbuf_len~0; {19041#true} is VALID
[2020-07-18 00:49:07,789 INFO L280 TraceCheckUtils]: 5: Hoare triple {19041#true} havoc ~t~0; {19041#true} is VALID
[2020-07-18 00:49:07,789 INFO L280 TraceCheckUtils]: 6: Hoare triple {19041#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {19041#true} is VALID
[2020-07-18 00:49:07,789 INFO L280 TraceCheckUtils]: 7: Hoare triple {19041#true} ~tagbuf_len~0 := #t~nondet0; {19041#true} is VALID
[2020-07-18 00:49:07,790 INFO L280 TraceCheckUtils]: 8: Hoare triple {19041#true} havoc #t~nondet0; {19041#true} is VALID
[2020-07-18 00:49:07,791 INFO L280 TraceCheckUtils]: 9: Hoare triple {19041#true} assume ~tagbuf_len~0 >= 1; {19045#(<= 1 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,792 INFO L280 TraceCheckUtils]: 10: Hoare triple {19045#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,792 INFO L280 TraceCheckUtils]: 11: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,793 INFO L280 TraceCheckUtils]: 12: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,794 INFO L280 TraceCheckUtils]: 13: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,794 INFO L280 TraceCheckUtils]: 14: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,795 INFO L280 TraceCheckUtils]: 15: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,796 INFO L280 TraceCheckUtils]: 16: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,796 INFO L280 TraceCheckUtils]: 17: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,797 INFO L280 TraceCheckUtils]: 18: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,797 INFO L263 TraceCheckUtils]: 19: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {19041#true} is VALID
[2020-07-18 00:49:07,798 INFO L280 TraceCheckUtils]: 20: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,798 INFO L280 TraceCheckUtils]: 21: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,798 INFO L280 TraceCheckUtils]: 22: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,799 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,799 INFO L263 TraceCheckUtils]: 24: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {19041#true} is VALID
[2020-07-18 00:49:07,800 INFO L280 TraceCheckUtils]: 25: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,800 INFO L280 TraceCheckUtils]: 26: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,800 INFO L280 TraceCheckUtils]: 27: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,802 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,803 INFO L280 TraceCheckUtils]: 29: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {19056#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,804 INFO L280 TraceCheckUtils]: 30: Hoare triple {19056#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,805 INFO L280 TraceCheckUtils]: 31: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,805 INFO L280 TraceCheckUtils]: 32: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,806 INFO L280 TraceCheckUtils]: 33: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,807 INFO L280 TraceCheckUtils]: 34: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,808 INFO L280 TraceCheckUtils]: 35: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,809 INFO L280 TraceCheckUtils]: 36: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,810 INFO L280 TraceCheckUtils]: 37: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,812 INFO L280 TraceCheckUtils]: 38: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,812 INFO L280 TraceCheckUtils]: 39: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,813 INFO L263 TraceCheckUtils]: 40: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {19041#true} is VALID
[2020-07-18 00:49:07,813 INFO L280 TraceCheckUtils]: 41: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,813 INFO L280 TraceCheckUtils]: 42: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,814 INFO L280 TraceCheckUtils]: 43: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,815 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,815 INFO L263 TraceCheckUtils]: 45: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {19041#true} is VALID
[2020-07-18 00:49:07,815 INFO L280 TraceCheckUtils]: 46: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,816 INFO L280 TraceCheckUtils]: 47: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,816 INFO L280 TraceCheckUtils]: 48: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,817 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,818 INFO L280 TraceCheckUtils]: 50: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post9 := ~t~0; {19065#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,819 INFO L280 TraceCheckUtils]: 51: Hoare triple {19065#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post9; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,820 INFO L280 TraceCheckUtils]: 52: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post9; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,820 INFO L280 TraceCheckUtils]: 53: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,821 INFO L280 TraceCheckUtils]: 54: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,822 INFO L280 TraceCheckUtils]: 55: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,824 INFO L280 TraceCheckUtils]: 56: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,824 INFO L280 TraceCheckUtils]: 57: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,825 INFO L280 TraceCheckUtils]: 58: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,826 INFO L280 TraceCheckUtils]: 59: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet6; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,827 INFO L280 TraceCheckUtils]: 60: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,827 INFO L263 TraceCheckUtils]: 61: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {19041#true} is VALID
[2020-07-18 00:49:07,827 INFO L280 TraceCheckUtils]: 62: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,828 INFO L280 TraceCheckUtils]: 63: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,828 INFO L280 TraceCheckUtils]: 64: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,829 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,830 INFO L263 TraceCheckUtils]: 66: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {19041#true} is VALID
[2020-07-18 00:49:07,830 INFO L280 TraceCheckUtils]: 67: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,830 INFO L280 TraceCheckUtils]: 68: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,831 INFO L280 TraceCheckUtils]: 69: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,832 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,833 INFO L280 TraceCheckUtils]: 71: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post7 := ~t~0; {19074#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,834 INFO L280 TraceCheckUtils]: 72: Hoare triple {19074#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post7; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,836 INFO L280 TraceCheckUtils]: 73: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post7; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,836 INFO L280 TraceCheckUtils]: 74: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,837 INFO L263 TraceCheckUtils]: 75: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {19041#true} is VALID
[2020-07-18 00:49:07,837 INFO L280 TraceCheckUtils]: 76: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID
[2020-07-18 00:49:07,837 INFO L280 TraceCheckUtils]: 77: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID
[2020-07-18 00:49:07,838 INFO L280 TraceCheckUtils]: 78: Hoare triple {19041#true} assume true; {19041#true} is VALID
[2020-07-18 00:49:07,839 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {19041#true} {19047#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:07,840 INFO L263 TraceCheckUtils]: 80: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {19079#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:49:07,841 INFO L280 TraceCheckUtils]: 81: Hoare triple {19079#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {19080#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:49:07,842 INFO L280 TraceCheckUtils]: 82: Hoare triple {19080#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {19042#false} is VALID
[2020-07-18 00:49:07,842 INFO L280 TraceCheckUtils]: 83: Hoare triple {19042#false} assume !false; {19042#false} is VALID
[2020-07-18 00:49:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:49:07,856 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:49:07,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1926788278]
[2020-07-18 00:49:07,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:49:07,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-07-18 00:49:07,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458968689]
[2020-07-18 00:49:07,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84
[2020-07-18 00:49:07,861 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:49:07,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states.
[2020-07-18 00:49:07,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:07,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-07-18 00:49:07,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:49:07,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-07-18 00:49:07,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2020-07-18 00:49:07,951 INFO L87 Difference]: Start difference. First operand 253 states and 291 transitions. Second operand 10 states.
[2020-07-18 00:49:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:09,523 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions.
[2020-07-18 00:49:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2020-07-18 00:49:09,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84
[2020-07-18 00:49:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:49:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2020-07-18 00:49:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions.
[2020-07-18 00:49:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2020-07-18 00:49:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions.
[2020-07-18 00:49:09,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 135 transitions.
[2020-07-18 00:49:09,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:09,682 INFO L225 Difference]: With dead ends: 262
[2020-07-18 00:49:09,682 INFO L226 Difference]: Without dead ends: 152
[2020-07-18 00:49:09,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306
[2020-07-18 00:49:09,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2020-07-18 00:49:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150.
[2020-07-18 00:49:09,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:49:09,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 150 states.
[2020-07-18 00:49:09,885 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 150 states.
[2020-07-18 00:49:09,885 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 150 states.
[2020-07-18 00:49:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:09,888 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions.
[2020-07-18 00:49:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions.
[2020-07-18 00:49:09,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:09,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:09,889 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 152 states.
[2020-07-18 00:49:09,889 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 152 states.
[2020-07-18 00:49:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:09,893 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions.
[2020-07-18 00:49:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions.
[2020-07-18 00:49:09,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:09,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:09,894 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:49:09,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:49:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states.
[2020-07-18 00:49:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions.
[2020-07-18 00:49:09,897 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 84
[2020-07-18 00:49:09,897 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:49:09,897 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions.
[2020-07-18 00:49:09,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-07-18 00:49:09,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 150 states and 170 transitions.
[2020-07-18 00:49:10,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions.
[2020-07-18 00:49:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2020-07-18 00:49:10,134 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:49:10,134 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:49:10,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2020-07-18 00:49:10,135 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:49:10,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:49:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1405253968, now seen corresponding path program 2 times
[2020-07-18 00:49:10,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:49:10,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1309512792]
[2020-07-18 00:49:10,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:49:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:10,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,363 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {20227#true} {20227#true} #144#return; {20227#true} is VALID
[2020-07-18 00:49:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:10,367 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,368 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:10,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,375 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:10,380 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,380 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,381 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,382 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:10,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,387 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,388 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:10,395 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,396 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,397 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:10,404 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,404 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,406 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:10,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,411 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,411 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20233#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,412 INFO L263 TraceCheckUtils]: 0: Hoare triple {20227#true} call ULTIMATE.init(); {20227#true} is VALID
[2020-07-18 00:49:10,412 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,412 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {20227#true} {20227#true} #144#return; {20227#true} is VALID
[2020-07-18 00:49:10,412 INFO L263 TraceCheckUtils]: 3: Hoare triple {20227#true} call #t~ret10 := main(); {20227#true} is VALID
[2020-07-18 00:49:10,413 INFO L280 TraceCheckUtils]: 4: Hoare triple {20227#true} havoc ~tagbuf_len~0; {20227#true} is VALID
[2020-07-18 00:49:10,413 INFO L280 TraceCheckUtils]: 5: Hoare triple {20227#true} havoc ~t~0; {20227#true} is VALID
[2020-07-18 00:49:10,413 INFO L280 TraceCheckUtils]: 6: Hoare triple {20227#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {20227#true} is VALID
[2020-07-18 00:49:10,413 INFO L280 TraceCheckUtils]: 7: Hoare triple {20227#true} ~tagbuf_len~0 := #t~nondet0; {20227#true} is VALID
[2020-07-18 00:49:10,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {20227#true} havoc #t~nondet0; {20227#true} is VALID
[2020-07-18 00:49:10,414 INFO L280 TraceCheckUtils]: 9: Hoare triple {20227#true} assume ~tagbuf_len~0 >= 1; {20231#(<= 1 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,415 INFO L280 TraceCheckUtils]: 10: Hoare triple {20231#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,415 INFO L280 TraceCheckUtils]: 11: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,416 INFO L280 TraceCheckUtils]: 12: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,417 INFO L280 TraceCheckUtils]: 13: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,417 INFO L280 TraceCheckUtils]: 14: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,418 INFO L280 TraceCheckUtils]: 15: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,419 INFO L280 TraceCheckUtils]: 16: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,419 INFO L280 TraceCheckUtils]: 17: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,420 INFO L280 TraceCheckUtils]: 18: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,420 INFO L263 TraceCheckUtils]: 19: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {20227#true} is VALID
[2020-07-18 00:49:10,420 INFO L280 TraceCheckUtils]: 20: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,420 INFO L280 TraceCheckUtils]: 21: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,421 INFO L280 TraceCheckUtils]: 22: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,421 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,422 INFO L263 TraceCheckUtils]: 24: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {20227#true} is VALID
[2020-07-18 00:49:10,422 INFO L280 TraceCheckUtils]: 25: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,422 INFO L280 TraceCheckUtils]: 26: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,422 INFO L280 TraceCheckUtils]: 27: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,423 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,424 INFO L280 TraceCheckUtils]: 29: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {20242#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,425 INFO L280 TraceCheckUtils]: 30: Hoare triple {20242#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,426 INFO L280 TraceCheckUtils]: 31: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,426 INFO L280 TraceCheckUtils]: 32: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,427 INFO L280 TraceCheckUtils]: 33: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,431 INFO L280 TraceCheckUtils]: 34: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,431 INFO L280 TraceCheckUtils]: 35: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,432 INFO L280 TraceCheckUtils]: 36: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,432 INFO L263 TraceCheckUtils]: 37: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {20227#true} is VALID
[2020-07-18 00:49:10,432 INFO L280 TraceCheckUtils]: 38: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,432 INFO L280 TraceCheckUtils]: 39: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,433 INFO L280 TraceCheckUtils]: 40: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,433 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,434 INFO L263 TraceCheckUtils]: 42: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {20227#true} is VALID
[2020-07-18 00:49:10,434 INFO L280 TraceCheckUtils]: 43: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,434 INFO L280 TraceCheckUtils]: 44: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,434 INFO L280 TraceCheckUtils]: 45: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,435 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,436 INFO L280 TraceCheckUtils]: 47: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {20251#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,437 INFO L280 TraceCheckUtils]: 48: Hoare triple {20251#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,438 INFO L280 TraceCheckUtils]: 49: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,439 INFO L280 TraceCheckUtils]: 50: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,440 INFO L280 TraceCheckUtils]: 51: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,441 INFO L280 TraceCheckUtils]: 52: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,442 INFO L280 TraceCheckUtils]: 53: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,443 INFO L280 TraceCheckUtils]: 54: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,444 INFO L280 TraceCheckUtils]: 55: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,444 INFO L280 TraceCheckUtils]: 56: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,445 INFO L280 TraceCheckUtils]: 57: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,446 INFO L263 TraceCheckUtils]: 58: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {20227#true} is VALID
[2020-07-18 00:49:10,446 INFO L280 TraceCheckUtils]: 59: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,446 INFO L280 TraceCheckUtils]: 60: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,447 INFO L280 TraceCheckUtils]: 61: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,448 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,448 INFO L263 TraceCheckUtils]: 63: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {20227#true} is VALID
[2020-07-18 00:49:10,449 INFO L280 TraceCheckUtils]: 64: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,449 INFO L280 TraceCheckUtils]: 65: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,449 INFO L280 TraceCheckUtils]: 66: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,450 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,451 INFO L280 TraceCheckUtils]: 68: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post9 := ~t~0; {20260#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,452 INFO L280 TraceCheckUtils]: 69: Hoare triple {20260#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post9; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,453 INFO L280 TraceCheckUtils]: 70: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post9; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,454 INFO L280 TraceCheckUtils]: 71: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,455 INFO L280 TraceCheckUtils]: 72: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,456 INFO L280 TraceCheckUtils]: 73: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,457 INFO L280 TraceCheckUtils]: 74: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet5; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,457 INFO L280 TraceCheckUtils]: 75: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet5; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,458 INFO L280 TraceCheckUtils]: 76: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,459 INFO L280 TraceCheckUtils]: 77: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,460 INFO L280 TraceCheckUtils]: 78: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet6; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,460 INFO L263 TraceCheckUtils]: 79: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {20227#true} is VALID
[2020-07-18 00:49:10,461 INFO L280 TraceCheckUtils]: 80: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID
[2020-07-18 00:49:10,461 INFO L280 TraceCheckUtils]: 81: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID
[2020-07-18 00:49:10,461 INFO L280 TraceCheckUtils]: 82: Hoare triple {20227#true} assume true; {20227#true} is VALID
[2020-07-18 00:49:10,462 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {20227#true} {20233#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:10,464 INFO L263 TraceCheckUtils]: 84: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {20265#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:49:10,465 INFO L280 TraceCheckUtils]: 85: Hoare triple {20265#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {20266#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:49:10,466 INFO L280 TraceCheckUtils]: 86: Hoare triple {20266#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {20228#false} is VALID
[2020-07-18 00:49:10,466 INFO L280 TraceCheckUtils]: 87: Hoare triple {20228#false} assume !false; {20228#false} is VALID
[2020-07-18 00:49:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:49:10,478 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:49:10,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1309512792]
[2020-07-18 00:49:10,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:49:10,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-07-18 00:49:10,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16010782]
[2020-07-18 00:49:10,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88
[2020-07-18 00:49:10,479 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:49:10,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states.
[2020-07-18 00:49:10,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:10,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-07-18 00:49:10,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:49:10,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-07-18 00:49:10,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2020-07-18 00:49:10,576 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 10 states.
[2020-07-18 00:49:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:11,634 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions.
[2020-07-18 00:49:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2020-07-18 00:49:11,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88
[2020-07-18 00:49:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:49:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2020-07-18 00:49:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 113 transitions.
[2020-07-18 00:49:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2020-07-18 00:49:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 113 transitions.
[2020-07-18 00:49:11,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 113 transitions.
[2020-07-18 00:49:11,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:11,780 INFO L225 Difference]: With dead ends: 160
[2020-07-18 00:49:11,780 INFO L226 Difference]: Without dead ends: 155
[2020-07-18 00:49:11,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306
[2020-07-18 00:49:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states.
[2020-07-18 00:49:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153.
[2020-07-18 00:49:11,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:49:11,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 153 states.
[2020-07-18 00:49:11,997 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 153 states.
[2020-07-18 00:49:11,997 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 153 states.
[2020-07-18 00:49:12,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:12,000 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions.
[2020-07-18 00:49:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions.
[2020-07-18 00:49:12,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:12,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:12,001 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 155 states.
[2020-07-18 00:49:12,002 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 155 states.
[2020-07-18 00:49:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:12,005 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions.
[2020-07-18 00:49:12,005 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions.
[2020-07-18 00:49:12,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:12,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:12,005 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:49:12,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:49:12,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states.
[2020-07-18 00:49:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions.
[2020-07-18 00:49:12,009 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 88
[2020-07-18 00:49:12,009 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:49:12,009 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions.
[2020-07-18 00:49:12,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-07-18 00:49:12,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states and 171 transitions.
[2020-07-18 00:49:12,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions.
[2020-07-18 00:49:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2020-07-18 00:49:12,252 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:49:12,252 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:49:12,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2020-07-18 00:49:12,253 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:49:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:49:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash 813915649, now seen corresponding path program 1 times
[2020-07-18 00:49:12,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:49:12,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1001013531]
[2020-07-18 00:49:12,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:49:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:12,411 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,411 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {21221#true} {21221#true} #144#return; {21221#true} is VALID
[2020-07-18 00:49:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:12,415 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,416 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21225#(<= 0 main_~t~0)} #152#return; {21225#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:12,420 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,420 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,421 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,421 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21225#(<= 0 main_~t~0)} #154#return; {21225#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:12,424 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,425 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,425 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,425 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21235#(<= 1 main_~t~0)} #156#return; {21235#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:12,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,431 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21235#(<= 1 main_~t~0)} #158#return; {21235#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:12,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,434 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,435 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21245#(<= 2 main_~t~0)} #172#return; {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:12,438 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,439 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,441 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21245#(<= 2 main_~t~0)} #174#return; {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:12,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,445 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,445 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21255#(<= 3 main_~t~0)} #164#return; {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:12,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,451 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21255#(<= 3 main_~t~0)} #166#return; {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,452 INFO L263 TraceCheckUtils]: 0: Hoare triple {21221#true} call ULTIMATE.init(); {21221#true} is VALID
[2020-07-18 00:49:12,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,452 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21221#true} {21221#true} #144#return; {21221#true} is VALID
[2020-07-18 00:49:12,452 INFO L263 TraceCheckUtils]: 3: Hoare triple {21221#true} call #t~ret10 := main(); {21221#true} is VALID
[2020-07-18 00:49:12,452 INFO L280 TraceCheckUtils]: 4: Hoare triple {21221#true} havoc ~tagbuf_len~0; {21221#true} is VALID
[2020-07-18 00:49:12,452 INFO L280 TraceCheckUtils]: 5: Hoare triple {21221#true} havoc ~t~0; {21221#true} is VALID
[2020-07-18 00:49:12,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {21221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {21221#true} is VALID
[2020-07-18 00:49:12,453 INFO L280 TraceCheckUtils]: 7: Hoare triple {21221#true} ~tagbuf_len~0 := #t~nondet0; {21221#true} is VALID
[2020-07-18 00:49:12,453 INFO L280 TraceCheckUtils]: 8: Hoare triple {21221#true} havoc #t~nondet0; {21221#true} is VALID
[2020-07-18 00:49:12,453 INFO L280 TraceCheckUtils]: 9: Hoare triple {21221#true} assume ~tagbuf_len~0 >= 1; {21221#true} is VALID
[2020-07-18 00:49:12,454 INFO L280 TraceCheckUtils]: 10: Hoare triple {21221#true} ~t~0 := 0; {21225#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:12,454 INFO L280 TraceCheckUtils]: 11: Hoare triple {21225#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {21225#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:12,455 INFO L280 TraceCheckUtils]: 12: Hoare triple {21225#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {21225#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:12,455 INFO L280 TraceCheckUtils]: 13: Hoare triple {21225#(<= 0 main_~t~0)} havoc #t~pre1; {21225#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:12,456 INFO L280 TraceCheckUtils]: 14: Hoare triple {21225#(<= 0 main_~t~0)} assume !false; {21225#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:12,457 INFO L280 TraceCheckUtils]: 15: Hoare triple {21225#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21225#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:12,457 INFO L280 TraceCheckUtils]: 16: Hoare triple {21225#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {21225#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:12,458 INFO L280 TraceCheckUtils]: 17: Hoare triple {21225#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {21225#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:12,458 INFO L280 TraceCheckUtils]: 18: Hoare triple {21225#(<= 0 main_~t~0)} havoc #t~nondet2; {21225#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:12,459 INFO L263 TraceCheckUtils]: 19: Hoare triple {21225#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21221#true} is VALID
[2020-07-18 00:49:12,459 INFO L280 TraceCheckUtils]: 20: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,459 INFO L280 TraceCheckUtils]: 21: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,459 INFO L280 TraceCheckUtils]: 22: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,460 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {21221#true} {21225#(<= 0 main_~t~0)} #152#return; {21225#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:12,460 INFO L263 TraceCheckUtils]: 24: Hoare triple {21225#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {21221#true} is VALID
[2020-07-18 00:49:12,460 INFO L280 TraceCheckUtils]: 25: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,460 INFO L280 TraceCheckUtils]: 26: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,461 INFO L280 TraceCheckUtils]: 27: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,461 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {21221#true} {21225#(<= 0 main_~t~0)} #154#return; {21225#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:12,462 INFO L280 TraceCheckUtils]: 29: Hoare triple {21225#(<= 0 main_~t~0)} #t~post3 := ~t~0; {21234#(<= 0 |main_#t~post3|)} is VALID
[2020-07-18 00:49:12,463 INFO L280 TraceCheckUtils]: 30: Hoare triple {21234#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {21235#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:12,463 INFO L280 TraceCheckUtils]: 31: Hoare triple {21235#(<= 1 main_~t~0)} havoc #t~post3; {21235#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:12,464 INFO L280 TraceCheckUtils]: 32: Hoare triple {21235#(<= 1 main_~t~0)} assume !false; {21235#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:12,465 INFO L280 TraceCheckUtils]: 33: Hoare triple {21235#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21235#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:12,465 INFO L280 TraceCheckUtils]: 34: Hoare triple {21235#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {21235#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:12,466 INFO L280 TraceCheckUtils]: 35: Hoare triple {21235#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {21235#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:12,467 INFO L280 TraceCheckUtils]: 36: Hoare triple {21235#(<= 1 main_~t~0)} havoc #t~nondet2; {21235#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:12,467 INFO L263 TraceCheckUtils]: 37: Hoare triple {21235#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21221#true} is VALID
[2020-07-18 00:49:12,468 INFO L280 TraceCheckUtils]: 38: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,468 INFO L280 TraceCheckUtils]: 39: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,468 INFO L280 TraceCheckUtils]: 40: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,469 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {21221#true} {21235#(<= 1 main_~t~0)} #156#return; {21235#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:12,469 INFO L263 TraceCheckUtils]: 42: Hoare triple {21235#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {21221#true} is VALID
[2020-07-18 00:49:12,470 INFO L280 TraceCheckUtils]: 43: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,470 INFO L280 TraceCheckUtils]: 44: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,470 INFO L280 TraceCheckUtils]: 45: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,471 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {21221#true} {21235#(<= 1 main_~t~0)} #158#return; {21235#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:12,472 INFO L280 TraceCheckUtils]: 47: Hoare triple {21235#(<= 1 main_~t~0)} #t~post4 := ~t~0; {21244#(<= 1 |main_#t~post4|)} is VALID
[2020-07-18 00:49:12,473 INFO L280 TraceCheckUtils]: 48: Hoare triple {21244#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,474 INFO L280 TraceCheckUtils]: 49: Hoare triple {21245#(<= 2 main_~t~0)} havoc #t~post4; {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,475 INFO L280 TraceCheckUtils]: 50: Hoare triple {21245#(<= 2 main_~t~0)} assume !false; {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,476 INFO L280 TraceCheckUtils]: 51: Hoare triple {21245#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,477 INFO L280 TraceCheckUtils]: 52: Hoare triple {21245#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,477 INFO L280 TraceCheckUtils]: 53: Hoare triple {21245#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,478 INFO L280 TraceCheckUtils]: 54: Hoare triple {21245#(<= 2 main_~t~0)} havoc #t~nondet5; {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,479 INFO L280 TraceCheckUtils]: 55: Hoare triple {21245#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,480 INFO L280 TraceCheckUtils]: 56: Hoare triple {21245#(<= 2 main_~t~0)} assume !(0 != #t~nondet6); {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,480 INFO L280 TraceCheckUtils]: 57: Hoare triple {21245#(<= 2 main_~t~0)} havoc #t~nondet6; {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,481 INFO L263 TraceCheckUtils]: 58: Hoare triple {21245#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21221#true} is VALID
[2020-07-18 00:49:12,481 INFO L280 TraceCheckUtils]: 59: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,481 INFO L280 TraceCheckUtils]: 60: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,482 INFO L280 TraceCheckUtils]: 61: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,483 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {21221#true} {21245#(<= 2 main_~t~0)} #172#return; {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,483 INFO L263 TraceCheckUtils]: 63: Hoare triple {21245#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {21221#true} is VALID
[2020-07-18 00:49:12,483 INFO L280 TraceCheckUtils]: 64: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,484 INFO L280 TraceCheckUtils]: 65: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,484 INFO L280 TraceCheckUtils]: 66: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,485 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {21221#true} {21245#(<= 2 main_~t~0)} #174#return; {21245#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:12,486 INFO L280 TraceCheckUtils]: 68: Hoare triple {21245#(<= 2 main_~t~0)} #t~post9 := ~t~0; {21254#(<= 2 |main_#t~post9|)} is VALID
[2020-07-18 00:49:12,487 INFO L280 TraceCheckUtils]: 69: Hoare triple {21254#(<= 2 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,488 INFO L280 TraceCheckUtils]: 70: Hoare triple {21255#(<= 3 main_~t~0)} havoc #t~post9; {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,489 INFO L280 TraceCheckUtils]: 71: Hoare triple {21255#(<= 3 main_~t~0)} assume !false; {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,489 INFO L280 TraceCheckUtils]: 72: Hoare triple {21255#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,490 INFO L280 TraceCheckUtils]: 73: Hoare triple {21255#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,492 INFO L280 TraceCheckUtils]: 74: Hoare triple {21255#(<= 3 main_~t~0)} assume 0 != #t~nondet5; {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,492 INFO L280 TraceCheckUtils]: 75: Hoare triple {21255#(<= 3 main_~t~0)} havoc #t~nondet5; {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,495 INFO L280 TraceCheckUtils]: 76: Hoare triple {21255#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,495 INFO L280 TraceCheckUtils]: 77: Hoare triple {21255#(<= 3 main_~t~0)} assume 0 != #t~nondet6; {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,496 INFO L280 TraceCheckUtils]: 78: Hoare triple {21255#(<= 3 main_~t~0)} havoc #t~nondet6; {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,496 INFO L263 TraceCheckUtils]: 79: Hoare triple {21255#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21221#true} is VALID
[2020-07-18 00:49:12,497 INFO L280 TraceCheckUtils]: 80: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,497 INFO L280 TraceCheckUtils]: 81: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,497 INFO L280 TraceCheckUtils]: 82: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,498 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {21221#true} {21255#(<= 3 main_~t~0)} #164#return; {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,499 INFO L263 TraceCheckUtils]: 84: Hoare triple {21255#(<= 3 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {21221#true} is VALID
[2020-07-18 00:49:12,499 INFO L280 TraceCheckUtils]: 85: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID
[2020-07-18 00:49:12,499 INFO L280 TraceCheckUtils]: 86: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID
[2020-07-18 00:49:12,500 INFO L280 TraceCheckUtils]: 87: Hoare triple {21221#true} assume true; {21221#true} is VALID
[2020-07-18 00:49:12,501 INFO L275 TraceCheckUtils]: 88: Hoare quadruple {21221#true} {21255#(<= 3 main_~t~0)} #166#return; {21255#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:12,501 INFO L280 TraceCheckUtils]: 89: Hoare triple {21255#(<= 3 main_~t~0)} #t~post7 := ~t~0; {21264#(<= 3 |main_#t~post7|)} is VALID
[2020-07-18 00:49:12,502 INFO L280 TraceCheckUtils]: 90: Hoare triple {21264#(<= 3 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {21265#(<= 4 main_~t~0)} is VALID
[2020-07-18 00:49:12,503 INFO L280 TraceCheckUtils]: 91: Hoare triple {21265#(<= 4 main_~t~0)} havoc #t~post7; {21265#(<= 4 main_~t~0)} is VALID
[2020-07-18 00:49:12,504 INFO L280 TraceCheckUtils]: 92: Hoare triple {21265#(<= 4 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21265#(<= 4 main_~t~0)} is VALID
[2020-07-18 00:49:12,505 INFO L263 TraceCheckUtils]: 93: Hoare triple {21265#(<= 4 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21266#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:49:12,505 INFO L280 TraceCheckUtils]: 94: Hoare triple {21266#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {21267#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:49:12,506 INFO L280 TraceCheckUtils]: 95: Hoare triple {21267#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {21222#false} is VALID
[2020-07-18 00:49:12,506 INFO L280 TraceCheckUtils]: 96: Hoare triple {21222#false} assume !false; {21222#false} is VALID
[2020-07-18 00:49:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:49:12,519 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:49:12,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1001013531]
[2020-07-18 00:49:12,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:49:12,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2020-07-18 00:49:12,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400082969]
[2020-07-18 00:49:12,521 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97
[2020-07-18 00:49:12,521 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:49:12,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states.
[2020-07-18 00:49:12,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:12,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-07-18 00:49:12,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:49:12,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-07-18 00:49:12,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2020-07-18 00:49:12,625 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 13 states.
[2020-07-18 00:49:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:14,417 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions.
[2020-07-18 00:49:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2020-07-18 00:49:14,417 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97
[2020-07-18 00:49:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:49:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-07-18 00:49:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions.
[2020-07-18 00:49:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-07-18 00:49:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions.
[2020-07-18 00:49:14,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 159 transitions.
[2020-07-18 00:49:14,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:14,615 INFO L225 Difference]: With dead ends: 194
[2020-07-18 00:49:14,615 INFO L226 Difference]: Without dead ends: 192
[2020-07-18 00:49:14,616 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506
[2020-07-18 00:49:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states.
[2020-07-18 00:49:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 183.
[2020-07-18 00:49:14,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:49:14,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 183 states.
[2020-07-18 00:49:14,867 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 183 states.
[2020-07-18 00:49:14,867 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 183 states.
[2020-07-18 00:49:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:14,871 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions.
[2020-07-18 00:49:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 219 transitions.
[2020-07-18 00:49:14,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:14,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:14,872 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 192 states.
[2020-07-18 00:49:14,872 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 192 states.
[2020-07-18 00:49:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:14,877 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions.
[2020-07-18 00:49:14,877 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 219 transitions.
[2020-07-18 00:49:14,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:14,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:14,878 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:49:14,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:49:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states.
[2020-07-18 00:49:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions.
[2020-07-18 00:49:14,882 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 97
[2020-07-18 00:49:14,882 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:49:14,882 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions.
[2020-07-18 00:49:14,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-07-18 00:49:14,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 183 states and 208 transitions.
[2020-07-18 00:49:15,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions.
[2020-07-18 00:49:15,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2020-07-18 00:49:15,201 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:49:15,202 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:49:15,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2020-07-18 00:49:15,202 INFO L427 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:49:15,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:49:15,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1992677655, now seen corresponding path program 2 times
[2020-07-18 00:49:15,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:49:15,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2095013006]
[2020-07-18 00:49:15,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:49:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:15,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,387 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22428#true} {22428#true} #144#return; {22428#true} is VALID
[2020-07-18 00:49:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:15,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,391 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,392 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22432#(<= 0 main_~t~0)} #152#return; {22432#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:15,395 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,396 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,396 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,397 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22432#(<= 0 main_~t~0)} #154#return; {22432#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:15,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,402 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22442#(<= 1 main_~t~0)} #156#return; {22442#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:15,406 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,408 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22442#(<= 1 main_~t~0)} #158#return; {22442#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:15,412 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,413 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,414 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22452#(<= 2 main_~t~0)} #164#return; {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:15,419 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,419 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,420 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22452#(<= 2 main_~t~0)} #166#return; {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:15,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,424 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,425 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22462#(<= 3 main_~t~0)} #172#return; {22462#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:15,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,430 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22462#(<= 3 main_~t~0)} #174#return; {22462#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:15,431 INFO L263 TraceCheckUtils]: 0: Hoare triple {22428#true} call ULTIMATE.init(); {22428#true} is VALID
[2020-07-18 00:49:15,431 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,431 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22428#true} {22428#true} #144#return; {22428#true} is VALID
[2020-07-18 00:49:15,432 INFO L263 TraceCheckUtils]: 3: Hoare triple {22428#true} call #t~ret10 := main(); {22428#true} is VALID
[2020-07-18 00:49:15,432 INFO L280 TraceCheckUtils]: 4: Hoare triple {22428#true} havoc ~tagbuf_len~0; {22428#true} is VALID
[2020-07-18 00:49:15,432 INFO L280 TraceCheckUtils]: 5: Hoare triple {22428#true} havoc ~t~0; {22428#true} is VALID
[2020-07-18 00:49:15,433 INFO L280 TraceCheckUtils]: 6: Hoare triple {22428#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {22428#true} is VALID
[2020-07-18 00:49:15,433 INFO L280 TraceCheckUtils]: 7: Hoare triple {22428#true} ~tagbuf_len~0 := #t~nondet0; {22428#true} is VALID
[2020-07-18 00:49:15,433 INFO L280 TraceCheckUtils]: 8: Hoare triple {22428#true} havoc #t~nondet0; {22428#true} is VALID
[2020-07-18 00:49:15,434 INFO L280 TraceCheckUtils]: 9: Hoare triple {22428#true} assume ~tagbuf_len~0 >= 1; {22428#true} is VALID
[2020-07-18 00:49:15,435 INFO L280 TraceCheckUtils]: 10: Hoare triple {22428#true} ~t~0 := 0; {22432#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:15,435 INFO L280 TraceCheckUtils]: 11: Hoare triple {22432#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {22432#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:15,436 INFO L280 TraceCheckUtils]: 12: Hoare triple {22432#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {22432#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:15,437 INFO L280 TraceCheckUtils]: 13: Hoare triple {22432#(<= 0 main_~t~0)} havoc #t~pre1; {22432#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:15,438 INFO L280 TraceCheckUtils]: 14: Hoare triple {22432#(<= 0 main_~t~0)} assume !false; {22432#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:15,438 INFO L280 TraceCheckUtils]: 15: Hoare triple {22432#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22432#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:15,439 INFO L280 TraceCheckUtils]: 16: Hoare triple {22432#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {22432#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:15,440 INFO L280 TraceCheckUtils]: 17: Hoare triple {22432#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {22432#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:15,441 INFO L280 TraceCheckUtils]: 18: Hoare triple {22432#(<= 0 main_~t~0)} havoc #t~nondet2; {22432#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:15,441 INFO L263 TraceCheckUtils]: 19: Hoare triple {22432#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22428#true} is VALID
[2020-07-18 00:49:15,441 INFO L280 TraceCheckUtils]: 20: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,441 INFO L280 TraceCheckUtils]: 21: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,442 INFO L280 TraceCheckUtils]: 22: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,443 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {22428#true} {22432#(<= 0 main_~t~0)} #152#return; {22432#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:15,443 INFO L263 TraceCheckUtils]: 24: Hoare triple {22432#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {22428#true} is VALID
[2020-07-18 00:49:15,443 INFO L280 TraceCheckUtils]: 25: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,444 INFO L280 TraceCheckUtils]: 26: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,444 INFO L280 TraceCheckUtils]: 27: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,445 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {22428#true} {22432#(<= 0 main_~t~0)} #154#return; {22432#(<= 0 main_~t~0)} is VALID
[2020-07-18 00:49:15,445 INFO L280 TraceCheckUtils]: 29: Hoare triple {22432#(<= 0 main_~t~0)} #t~post3 := ~t~0; {22441#(<= 0 |main_#t~post3|)} is VALID
[2020-07-18 00:49:15,446 INFO L280 TraceCheckUtils]: 30: Hoare triple {22441#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {22442#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:15,447 INFO L280 TraceCheckUtils]: 31: Hoare triple {22442#(<= 1 main_~t~0)} havoc #t~post3; {22442#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:15,447 INFO L280 TraceCheckUtils]: 32: Hoare triple {22442#(<= 1 main_~t~0)} assume !false; {22442#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:15,448 INFO L280 TraceCheckUtils]: 33: Hoare triple {22442#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22442#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:15,449 INFO L280 TraceCheckUtils]: 34: Hoare triple {22442#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {22442#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:15,449 INFO L280 TraceCheckUtils]: 35: Hoare triple {22442#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {22442#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:15,450 INFO L280 TraceCheckUtils]: 36: Hoare triple {22442#(<= 1 main_~t~0)} havoc #t~nondet2; {22442#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:15,450 INFO L263 TraceCheckUtils]: 37: Hoare triple {22442#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22428#true} is VALID
[2020-07-18 00:49:15,450 INFO L280 TraceCheckUtils]: 38: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,450 INFO L280 TraceCheckUtils]: 39: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,451 INFO L280 TraceCheckUtils]: 40: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,451 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {22428#true} {22442#(<= 1 main_~t~0)} #156#return; {22442#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:15,452 INFO L263 TraceCheckUtils]: 42: Hoare triple {22442#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {22428#true} is VALID
[2020-07-18 00:49:15,452 INFO L280 TraceCheckUtils]: 43: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,452 INFO L280 TraceCheckUtils]: 44: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,452 INFO L280 TraceCheckUtils]: 45: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,453 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {22428#true} {22442#(<= 1 main_~t~0)} #158#return; {22442#(<= 1 main_~t~0)} is VALID
[2020-07-18 00:49:15,454 INFO L280 TraceCheckUtils]: 47: Hoare triple {22442#(<= 1 main_~t~0)} #t~post4 := ~t~0; {22451#(<= 1 |main_#t~post4|)} is VALID
[2020-07-18 00:49:15,456 INFO L280 TraceCheckUtils]: 48: Hoare triple {22451#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,456 INFO L280 TraceCheckUtils]: 49: Hoare triple {22452#(<= 2 main_~t~0)} havoc #t~post4; {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,457 INFO L280 TraceCheckUtils]: 50: Hoare triple {22452#(<= 2 main_~t~0)} assume !false; {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,458 INFO L280 TraceCheckUtils]: 51: Hoare triple {22452#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,459 INFO L280 TraceCheckUtils]: 52: Hoare triple {22452#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,460 INFO L280 TraceCheckUtils]: 53: Hoare triple {22452#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,460 INFO L280 TraceCheckUtils]: 54: Hoare triple {22452#(<= 2 main_~t~0)} havoc #t~nondet5; {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,461 INFO L280 TraceCheckUtils]: 55: Hoare triple {22452#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,462 INFO L280 TraceCheckUtils]: 56: Hoare triple {22452#(<= 2 main_~t~0)} assume 0 != #t~nondet6; {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,462 INFO L280 TraceCheckUtils]: 57: Hoare triple {22452#(<= 2 main_~t~0)} havoc #t~nondet6; {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,463 INFO L263 TraceCheckUtils]: 58: Hoare triple {22452#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22428#true} is VALID
[2020-07-18 00:49:15,463 INFO L280 TraceCheckUtils]: 59: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,463 INFO L280 TraceCheckUtils]: 60: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,464 INFO L280 TraceCheckUtils]: 61: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,465 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {22428#true} {22452#(<= 2 main_~t~0)} #164#return; {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,465 INFO L263 TraceCheckUtils]: 63: Hoare triple {22452#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {22428#true} is VALID
[2020-07-18 00:49:15,465 INFO L280 TraceCheckUtils]: 64: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,466 INFO L280 TraceCheckUtils]: 65: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,466 INFO L280 TraceCheckUtils]: 66: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,467 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {22428#true} {22452#(<= 2 main_~t~0)} #166#return; {22452#(<= 2 main_~t~0)} is VALID
[2020-07-18 00:49:15,468 INFO L280 TraceCheckUtils]: 68: Hoare triple {22452#(<= 2 main_~t~0)} #t~post7 := ~t~0; {22461#(<= 2 |main_#t~post7|)} is VALID
[2020-07-18 00:49:15,468 INFO L280 TraceCheckUtils]: 69: Hoare triple {22461#(<= 2 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {22462#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:15,469 INFO L280 TraceCheckUtils]: 70: Hoare triple {22462#(<= 3 main_~t~0)} havoc #t~post7; {22462#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:15,470 INFO L280 TraceCheckUtils]: 71: Hoare triple {22462#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22462#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:15,470 INFO L263 TraceCheckUtils]: 72: Hoare triple {22462#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22428#true} is VALID
[2020-07-18 00:49:15,470 INFO L280 TraceCheckUtils]: 73: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,470 INFO L280 TraceCheckUtils]: 74: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,470 INFO L280 TraceCheckUtils]: 75: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,471 INFO L275 TraceCheckUtils]: 76: Hoare quadruple {22428#true} {22462#(<= 3 main_~t~0)} #172#return; {22462#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:15,472 INFO L263 TraceCheckUtils]: 77: Hoare triple {22462#(<= 3 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {22428#true} is VALID
[2020-07-18 00:49:15,472 INFO L280 TraceCheckUtils]: 78: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID
[2020-07-18 00:49:15,472 INFO L280 TraceCheckUtils]: 79: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID
[2020-07-18 00:49:15,472 INFO L280 TraceCheckUtils]: 80: Hoare triple {22428#true} assume true; {22428#true} is VALID
[2020-07-18 00:49:15,473 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {22428#true} {22462#(<= 3 main_~t~0)} #174#return; {22462#(<= 3 main_~t~0)} is VALID
[2020-07-18 00:49:15,474 INFO L280 TraceCheckUtils]: 82: Hoare triple {22462#(<= 3 main_~t~0)} #t~post9 := ~t~0; {22471#(<= 3 |main_#t~post9|)} is VALID
[2020-07-18 00:49:15,474 INFO L280 TraceCheckUtils]: 83: Hoare triple {22471#(<= 3 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {22472#(<= 4 main_~t~0)} is VALID
[2020-07-18 00:49:15,475 INFO L280 TraceCheckUtils]: 84: Hoare triple {22472#(<= 4 main_~t~0)} havoc #t~post9; {22472#(<= 4 main_~t~0)} is VALID
[2020-07-18 00:49:15,476 INFO L280 TraceCheckUtils]: 85: Hoare triple {22472#(<= 4 main_~t~0)} assume !false; {22472#(<= 4 main_~t~0)} is VALID
[2020-07-18 00:49:15,476 INFO L280 TraceCheckUtils]: 86: Hoare triple {22472#(<= 4 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22472#(<= 4 main_~t~0)} is VALID
[2020-07-18 00:49:15,477 INFO L280 TraceCheckUtils]: 87: Hoare triple {22472#(<= 4 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {22472#(<= 4 main_~t~0)} is VALID
[2020-07-18 00:49:15,478 INFO L280 TraceCheckUtils]: 88: Hoare triple {22472#(<= 4 main_~t~0)} assume 0 != #t~nondet5; {22472#(<= 4 main_~t~0)} is VALID
[2020-07-18 00:49:15,479 INFO L280 TraceCheckUtils]: 89: Hoare triple {22472#(<= 4 main_~t~0)} havoc #t~nondet5; {22472#(<= 4 main_~t~0)} is VALID
[2020-07-18 00:49:15,480 INFO L280 TraceCheckUtils]: 90: Hoare triple {22472#(<= 4 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {22472#(<= 4 main_~t~0)} is VALID
[2020-07-18 00:49:15,481 INFO L280 TraceCheckUtils]: 91: Hoare triple {22472#(<= 4 main_~t~0)} assume !(0 != #t~nondet6); {22472#(<= 4 main_~t~0)} is VALID
[2020-07-18 00:49:15,482 INFO L280 TraceCheckUtils]: 92: Hoare triple {22472#(<= 4 main_~t~0)} havoc #t~nondet6; {22472#(<= 4 main_~t~0)} is VALID
[2020-07-18 00:49:15,483 INFO L263 TraceCheckUtils]: 93: Hoare triple {22472#(<= 4 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22473#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:49:15,484 INFO L280 TraceCheckUtils]: 94: Hoare triple {22473#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {22474#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:49:15,484 INFO L280 TraceCheckUtils]: 95: Hoare triple {22474#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {22429#false} is VALID
[2020-07-18 00:49:15,485 INFO L280 TraceCheckUtils]: 96: Hoare triple {22429#false} assume !false; {22429#false} is VALID
[2020-07-18 00:49:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:49:15,494 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:49:15,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2095013006]
[2020-07-18 00:49:15,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:49:15,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2020-07-18 00:49:15,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930870636]
[2020-07-18 00:49:15,495 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97
[2020-07-18 00:49:15,496 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:49:15,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states.
[2020-07-18 00:49:15,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:15,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-07-18 00:49:15,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:49:15,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-07-18 00:49:15,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2020-07-18 00:49:15,584 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand 13 states.
[2020-07-18 00:49:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:17,140 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions.
[2020-07-18 00:49:17,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2020-07-18 00:49:17,140 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97
[2020-07-18 00:49:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:49:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-07-18 00:49:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions.
[2020-07-18 00:49:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-07-18 00:49:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions.
[2020-07-18 00:49:17,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 159 transitions.
[2020-07-18 00:49:17,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:17,342 INFO L225 Difference]: With dead ends: 198
[2020-07-18 00:49:17,342 INFO L226 Difference]: Without dead ends: 196
[2020-07-18 00:49:17,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506
[2020-07-18 00:49:17,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2020-07-18 00:49:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157.
[2020-07-18 00:49:17,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:49:17,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 157 states.
[2020-07-18 00:49:17,577 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 157 states.
[2020-07-18 00:49:17,578 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 157 states.
[2020-07-18 00:49:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:17,582 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions.
[2020-07-18 00:49:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 222 transitions.
[2020-07-18 00:49:17,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:17,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:17,583 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 196 states.
[2020-07-18 00:49:17,583 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 196 states.
[2020-07-18 00:49:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:17,587 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions.
[2020-07-18 00:49:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 222 transitions.
[2020-07-18 00:49:17,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:17,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:17,588 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:49:17,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:49:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states.
[2020-07-18 00:49:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions.
[2020-07-18 00:49:17,591 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 97
[2020-07-18 00:49:17,592 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:49:17,592 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions.
[2020-07-18 00:49:17,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-07-18 00:49:17,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 157 states and 174 transitions.
[2020-07-18 00:49:17,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions.
[2020-07-18 00:49:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2020-07-18 00:49:17,863 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 00:49:17,863 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 00:49:17,864 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2020-07-18 00:49:17,864 INFO L427 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 00:49:17,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 00:49:17,864 INFO L82 PathProgramCache]: Analyzing trace with hash 762056004, now seen corresponding path program 3 times
[2020-07-18 00:49:17,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 00:49:17,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [176883930]
[2020-07-18 00:49:17,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 00:49:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:18,095 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,095 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23599#true} {23599#true} #144#return; {23599#true} is VALID
[2020-07-18 00:49:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:18,099 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,099 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,100 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:18,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,104 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,104 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:18,108 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,108 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,109 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:18,113 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,113 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,114 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:18,118 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,118 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,118 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,119 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:18,122 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,123 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,123 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,124 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:18,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,128 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,128 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:18,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,133 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 00:49:18,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,139 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,140 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23605#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,140 INFO L263 TraceCheckUtils]: 0: Hoare triple {23599#true} call ULTIMATE.init(); {23599#true} is VALID
[2020-07-18 00:49:18,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,141 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23599#true} {23599#true} #144#return; {23599#true} is VALID
[2020-07-18 00:49:18,141 INFO L263 TraceCheckUtils]: 3: Hoare triple {23599#true} call #t~ret10 := main(); {23599#true} is VALID
[2020-07-18 00:49:18,141 INFO L280 TraceCheckUtils]: 4: Hoare triple {23599#true} havoc ~tagbuf_len~0; {23599#true} is VALID
[2020-07-18 00:49:18,141 INFO L280 TraceCheckUtils]: 5: Hoare triple {23599#true} havoc ~t~0; {23599#true} is VALID
[2020-07-18 00:49:18,142 INFO L280 TraceCheckUtils]: 6: Hoare triple {23599#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {23599#true} is VALID
[2020-07-18 00:49:18,142 INFO L280 TraceCheckUtils]: 7: Hoare triple {23599#true} ~tagbuf_len~0 := #t~nondet0; {23599#true} is VALID
[2020-07-18 00:49:18,142 INFO L280 TraceCheckUtils]: 8: Hoare triple {23599#true} havoc #t~nondet0; {23599#true} is VALID
[2020-07-18 00:49:18,143 INFO L280 TraceCheckUtils]: 9: Hoare triple {23599#true} assume ~tagbuf_len~0 >= 1; {23603#(<= 1 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,143 INFO L280 TraceCheckUtils]: 10: Hoare triple {23603#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,144 INFO L280 TraceCheckUtils]: 11: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,145 INFO L280 TraceCheckUtils]: 12: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,145 INFO L280 TraceCheckUtils]: 13: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,146 INFO L280 TraceCheckUtils]: 14: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,146 INFO L280 TraceCheckUtils]: 15: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,147 INFO L280 TraceCheckUtils]: 16: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,147 INFO L280 TraceCheckUtils]: 17: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,148 INFO L280 TraceCheckUtils]: 18: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,148 INFO L263 TraceCheckUtils]: 19: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID
[2020-07-18 00:49:18,148 INFO L280 TraceCheckUtils]: 20: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,149 INFO L280 TraceCheckUtils]: 21: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,149 INFO L280 TraceCheckUtils]: 22: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,150 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,150 INFO L263 TraceCheckUtils]: 24: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23599#true} is VALID
[2020-07-18 00:49:18,150 INFO L280 TraceCheckUtils]: 25: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,150 INFO L280 TraceCheckUtils]: 26: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,151 INFO L280 TraceCheckUtils]: 27: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,151 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,152 INFO L280 TraceCheckUtils]: 29: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {23614#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,153 INFO L280 TraceCheckUtils]: 30: Hoare triple {23614#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,153 INFO L280 TraceCheckUtils]: 31: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,154 INFO L280 TraceCheckUtils]: 32: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,155 INFO L280 TraceCheckUtils]: 33: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,155 INFO L280 TraceCheckUtils]: 34: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,156 INFO L280 TraceCheckUtils]: 35: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,156 INFO L280 TraceCheckUtils]: 36: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,157 INFO L263 TraceCheckUtils]: 37: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID
[2020-07-18 00:49:18,157 INFO L280 TraceCheckUtils]: 38: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,157 INFO L280 TraceCheckUtils]: 39: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,158 INFO L280 TraceCheckUtils]: 40: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,159 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,159 INFO L263 TraceCheckUtils]: 42: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23599#true} is VALID
[2020-07-18 00:49:18,159 INFO L280 TraceCheckUtils]: 43: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,159 INFO L280 TraceCheckUtils]: 44: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,160 INFO L280 TraceCheckUtils]: 45: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,161 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,162 INFO L280 TraceCheckUtils]: 47: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {23623#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,163 INFO L280 TraceCheckUtils]: 48: Hoare triple {23623#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,164 INFO L280 TraceCheckUtils]: 49: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,164 INFO L280 TraceCheckUtils]: 50: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,165 INFO L280 TraceCheckUtils]: 51: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,166 INFO L280 TraceCheckUtils]: 52: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,167 INFO L280 TraceCheckUtils]: 53: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,168 INFO L280 TraceCheckUtils]: 54: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,168 INFO L280 TraceCheckUtils]: 55: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,169 INFO L280 TraceCheckUtils]: 56: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,169 INFO L280 TraceCheckUtils]: 57: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,169 INFO L263 TraceCheckUtils]: 58: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID
[2020-07-18 00:49:18,170 INFO L280 TraceCheckUtils]: 59: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,170 INFO L280 TraceCheckUtils]: 60: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,170 INFO L280 TraceCheckUtils]: 61: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,171 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,171 INFO L263 TraceCheckUtils]: 63: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23599#true} is VALID
[2020-07-18 00:49:18,171 INFO L280 TraceCheckUtils]: 64: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,171 INFO L280 TraceCheckUtils]: 65: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,172 INFO L280 TraceCheckUtils]: 66: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,172 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,173 INFO L280 TraceCheckUtils]: 68: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post9 := ~t~0; {23632#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,175 INFO L280 TraceCheckUtils]: 69: Hoare triple {23632#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post9; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,175 INFO L280 TraceCheckUtils]: 70: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post9; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,176 INFO L280 TraceCheckUtils]: 71: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,177 INFO L280 TraceCheckUtils]: 72: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,178 INFO L280 TraceCheckUtils]: 73: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,179 INFO L280 TraceCheckUtils]: 74: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,179 INFO L280 TraceCheckUtils]: 75: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,180 INFO L280 TraceCheckUtils]: 76: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,181 INFO L280 TraceCheckUtils]: 77: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet6; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,181 INFO L280 TraceCheckUtils]: 78: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,182 INFO L263 TraceCheckUtils]: 79: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID
[2020-07-18 00:49:18,182 INFO L280 TraceCheckUtils]: 80: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,182 INFO L280 TraceCheckUtils]: 81: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,182 INFO L280 TraceCheckUtils]: 82: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,183 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,183 INFO L263 TraceCheckUtils]: 84: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23599#true} is VALID
[2020-07-18 00:49:18,183 INFO L280 TraceCheckUtils]: 85: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,183 INFO L280 TraceCheckUtils]: 86: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,184 INFO L280 TraceCheckUtils]: 87: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,185 INFO L275 TraceCheckUtils]: 88: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,186 INFO L280 TraceCheckUtils]: 89: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post7 := ~t~0; {23641#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,187 INFO L280 TraceCheckUtils]: 90: Hoare triple {23641#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post7; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,188 INFO L280 TraceCheckUtils]: 91: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post7; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,188 INFO L280 TraceCheckUtils]: 92: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,189 INFO L263 TraceCheckUtils]: 93: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID
[2020-07-18 00:49:18,189 INFO L280 TraceCheckUtils]: 94: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID
[2020-07-18 00:49:18,189 INFO L280 TraceCheckUtils]: 95: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID
[2020-07-18 00:49:18,189 INFO L280 TraceCheckUtils]: 96: Hoare triple {23599#true} assume true; {23599#true} is VALID
[2020-07-18 00:49:18,190 INFO L275 TraceCheckUtils]: 97: Hoare quadruple {23599#true} {23605#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID
[2020-07-18 00:49:18,191 INFO L263 TraceCheckUtils]: 98: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23646#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID
[2020-07-18 00:49:18,192 INFO L280 TraceCheckUtils]: 99: Hoare triple {23646#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {23647#(not (= 0 __VERIFIER_assert_~cond))} is VALID
[2020-07-18 00:49:18,193 INFO L280 TraceCheckUtils]: 100: Hoare triple {23647#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {23600#false} is VALID
[2020-07-18 00:49:18,193 INFO L280 TraceCheckUtils]: 101: Hoare triple {23600#false} assume !false; {23600#false} is VALID
[2020-07-18 00:49:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-18 00:49:18,208 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-18 00:49:18,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [176883930]
[2020-07-18 00:49:18,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 00:49:18,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-07-18 00:49:18,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976742236]
[2020-07-18 00:49:18,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102
[2020-07-18 00:49:18,210 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 00:49:18,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states.
[2020-07-18 00:49:18,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:18,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-07-18 00:49:18,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 00:49:18,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-07-18 00:49:18,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2020-07-18 00:49:18,294 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand 11 states.
[2020-07-18 00:49:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:19,470 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions.
[2020-07-18 00:49:19,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2020-07-18 00:49:19,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102
[2020-07-18 00:49:19,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 00:49:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-18 00:49:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions.
[2020-07-18 00:49:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-18 00:49:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions.
[2020-07-18 00:49:19,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 78 transitions.
[2020-07-18 00:49:19,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:19,581 INFO L225 Difference]: With dead ends: 157
[2020-07-18 00:49:19,581 INFO L226 Difference]: Without dead ends: 0
[2020-07-18 00:49:19,583 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420
[2020-07-18 00:49:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2020-07-18 00:49:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2020-07-18 00:49:19,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 00:49:19,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states.
[2020-07-18 00:49:19,584 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2020-07-18 00:49:19,584 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2020-07-18 00:49:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:19,584 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2020-07-18 00:49:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-18 00:49:19,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:19,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:19,585 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2020-07-18 00:49:19,585 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2020-07-18 00:49:19,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 00:49:19,585 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2020-07-18 00:49:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-18 00:49:19,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:19,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 00:49:19,586 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 00:49:19,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 00:49:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2020-07-18 00:49:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2020-07-18 00:49:19,586 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102
[2020-07-18 00:49:19,586 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 00:49:19,586 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2020-07-18 00:49:19,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-07-18 00:49:19,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions.
[2020-07-18 00:49:19,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 00:49:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-18 00:49:19,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 00:49:19,587 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2020-07-18 00:49:19,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2020-07-18 00:49:21,554 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true
[2020-07-18 00:49:21,555 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true
[2020-07-18 00:49:21,555 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true
[2020-07-18 00:49:21,555 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true
[2020-07-18 00:49:21,555 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2020-07-18 00:49:21,555 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true
[2020-07-18 00:49:21,556 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed.
[2020-07-18 00:49:21,556 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed.
[2020-07-18 00:49:21,556 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed.
[2020-07-18 00:49:21,556 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed.
[2020-07-18 00:49:21,556 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed.
[2020-07-18 00:49:21,557 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (and (<= (+ |main_#t~post9| 1) main_~tagbuf_len~0) (<= 1 |main_#t~post9|) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,557 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,557 INFO L264 CegarLoopResult]: At program point L60-1(line 60) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= (+ |main_#t~post9| 1) main_~tagbuf_len~0) (<= 1 |main_#t~post9|) (<= 2 main_~t~0))
[2020-07-18 00:49:21,557 INFO L264 CegarLoopResult]: At program point L27-1(lines 27 29) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,558 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,558 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 66) the Hoare annotation is: true
[2020-07-18 00:49:21,558 INFO L264 CegarLoopResult]: At program point L27-3(line 27) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,558 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,558 INFO L264 CegarLoopResult]: At program point L44-1(lines 44 53) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,559 INFO L264 CegarLoopResult]: At program point L44-2(line 44) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,559 INFO L264 CegarLoopResult]: At program point L44-4(line 44) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,559 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= (+ |main_#t~post4| 1) main_~tagbuf_len~0) (<= 0 |main_#t~post4|) (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,559 INFO L264 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: (and (<= (+ |main_#t~post4| 1) main_~tagbuf_len~0) (<= 0 |main_#t~post4|) (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,559 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,559 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,560 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))
[2020-07-18 00:49:21,560 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,560 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,560 INFO L264 CegarLoopResult]: At program point L37-2(lines 37 61) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,560 INFO L264 CegarLoopResult]: At program point L37-3(lines 37 61) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,561 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,561 INFO L264 CegarLoopResult]: At program point L21-2(lines 21 33) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))
[2020-07-18 00:49:21,561 INFO L264 CegarLoopResult]: At program point L21-3(lines 21 33) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,561 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,561 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 66) the Hoare annotation is: true
[2020-07-18 00:49:21,561 INFO L264 CegarLoopResult]: At program point L38(lines 38 42) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,561 INFO L271 CegarLoopResult]: At program point L63(lines 14 66) the Hoare annotation is: true
[2020-07-18 00:49:21,562 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,562 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 66) the Hoare annotation is: true
[2020-07-18 00:49:21,562 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,562 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,562 INFO L264 CegarLoopResult]: At program point L22(lines 22 26) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))
[2020-07-18 00:49:21,562 INFO L264 CegarLoopResult]: At program point L55-1(lines 55 57) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,562 INFO L264 CegarLoopResult]: At program point L55-2(line 55) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,562 INFO L264 CegarLoopResult]: At program point L55-3(line 55) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,563 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ |main_#t~post7| 1) main_~tagbuf_len~0) (<= 1 |main_#t~post7|) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,563 INFO L264 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (and (<= (+ |main_#t~post7| 1) main_~tagbuf_len~0) (<= main_~t~0 main_~tagbuf_len~0) (<= 1 |main_#t~post7|) (<= 2 main_~t~0))
[2020-07-18 00:49:21,563 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))
[2020-07-18 00:49:21,563 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (<= main_~t~0 main_~tagbuf_len~0)
[2020-07-18 00:49:21,563 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,563 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))
[2020-07-18 00:49:21,563 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (<= main_~t~0 main_~tagbuf_len~0)
[2020-07-18 00:49:21,564 INFO L264 CegarLoopResult]: At program point L48(lines 48 52) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 2 main_~t~0))
[2020-07-18 00:49:21,564 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= (+ |main_#t~post3| 1) main_~tagbuf_len~0) (<= 0 |main_#t~post3|) (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,564 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (and (<= (+ |main_#t~post3| 1) main_~tagbuf_len~0) (<= main_~t~0 main_~tagbuf_len~0) (<= 0 |main_#t~post3|) (<= 1 main_~t~0))
[2020-07-18 00:49:21,564 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))
[2020-07-18 00:49:21,564 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true
[2020-07-18 00:49:21,564 INFO L264 CegarLoopResult]: At program point L49-1(line 49) the Hoare annotation is: (<= main_~t~0 main_~tagbuf_len~0)
[2020-07-18 00:49:21,565 INFO L264 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,565 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true
[2020-07-18 00:49:21,565 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true
[2020-07-18 00:49:21,565 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true
[2020-07-18 00:49:21,565 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,565 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,566 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true
[2020-07-18 00:49:21,566 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (<= 1 main_~tagbuf_len~0)
[2020-07-18 00:49:21,566 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,566 INFO L264 CegarLoopResult]: At program point L43-1(lines 43 57) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,566 INFO L264 CegarLoopResult]: At program point L43-2(line 43) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,567 INFO L264 CegarLoopResult]: At program point L43-3(line 43) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,567 INFO L264 CegarLoopResult]: At program point L43-4(lines 43 57) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0))
[2020-07-18 00:49:21,567 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0))
[2020-07-18 00:49:21,567 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true
[2020-07-18 00:49:21,567 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond)))
[2020-07-18 00:49:21,567 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|)
[2020-07-18 00:49:21,568 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond)))
[2020-07-18 00:49:21,568 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond)))
[2020-07-18 00:49:21,568 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|)
[2020-07-18 00:49:21,573 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2020-07-18 00:49:21,581 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation
[2020-07-18 00:49:21,582 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation
[2020-07-18 00:49:21,589 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation
[2020-07-18 00:49:21,589 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation
[2020-07-18 00:49:21,633 INFO L163 areAnnotationChecker]: CFG has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2020-07-18 00:49:21,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:49:21 BoogieIcfgContainer
[2020-07-18 00:49:21,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-07-18 00:49:21,657 INFO L168 Benchmark]: Toolchain (without parser) took 51772.68 ms. Allocated memory was 146.8 MB in the beginning and 477.1 MB in the end (delta: 330.3 MB). Free memory was 104.1 MB in the beginning and 437.5 MB in the end (delta: -333.4 MB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-07-18 00:49:21,658 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 146.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB.
[2020-07-18 00:49:21,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.55 ms. Allocated memory is still 146.8 MB. Free memory was 103.6 MB in the beginning and 93.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB.
[2020-07-18 00:49:21,658 INFO L168 Benchmark]: Boogie Preprocessor took 43.74 ms. Allocated memory is still 146.8 MB. Free memory was 93.2 MB in the beginning and 91.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB.
[2020-07-18 00:49:21,659 INFO L168 Benchmark]: RCFGBuilder took 760.81 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 91.4 MB in the beginning and 150.0 MB in the end (delta: -58.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB.
[2020-07-18 00:49:21,662 INFO L168 Benchmark]: TraceAbstraction took 50716.63 ms. Allocated memory was 204.5 MB in the beginning and 477.1 MB in the end (delta: 272.6 MB). Free memory was 149.4 MB in the beginning and 437.5 MB in the end (delta: -288.1 MB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-07-18 00:49:21,664 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- AssertionsEnabledResult: Assertions are enabled
Assertions are enabled
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.13 ms. Allocated memory is still 146.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 244.55 ms. Allocated memory is still 146.8 MB. Free memory was 103.6 MB in the beginning and 93.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 43.74 ms. Allocated memory is still 146.8 MB. Free memory was 93.2 MB in the beginning and 91.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 760.81 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 91.4 MB in the beginning and 150.0 MB in the end (delta: -58.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 50716.63 ms. Allocated memory was 204.5 MB in the beginning and 477.1 MB in the end (delta: 272.6 MB). Free memory was 149.4 MB in the beginning and 437.5 MB in the end (delta: -288.1 MB). There was no memory consumed. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
- InvariantResult [Line: 21]: Loop Invariant
Derived loop invariant: t <= tagbuf_len && 0 <= t
- InvariantResult [Line: 37]: Loop Invariant
Derived loop invariant: t <= tagbuf_len && 1 <= t
- InvariantResult [Line: 14]: Loop Invariant
Derived loop invariant: 1
- ProcedureContractResult [Line: 13]: Procedure Contract for main
Derived contract for procedure main: 1
- ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert
Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond)
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 48.5s, OverallIterations: 25, TraceHistogramMax: 10, AutomataDifference: 30.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2053 SDtfs, 871 SDslu, 10785 SDs, 0 SdLazy, 3907 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 701 GetRequests, 359 SyntacticMatches, 33 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 193 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 74 LocationsWithAnnotation, 494 PreInvPairs, 814 NumberOfFragments, 537 HoareAnnotationTreeSize, 494 FomulaSimplifications, 529911 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 74 FomulaSimplificationsInter, 1449 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...