java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:40:39,033 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:40:39,035 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:40:39,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:40:39,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:40:39,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:40:39,051 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:40:39,053 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:40:39,055 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:40:39,055 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:40:39,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:40:39,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:40:39,058 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:40:39,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:40:39,060 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:40:39,061 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:40:39,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:40:39,063 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:40:39,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:40:39,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:40:39,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:40:39,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:40:39,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:40:39,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:40:39,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:40:39,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:40:39,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:40:39,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:40:39,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:40:39,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:40:39,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:40:39,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:40:39,079 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:40:39,079 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:40:39,080 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:40:39,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:40:39,081 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:40:39,104 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:40:39,104 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:40:39,105 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:40:39,105 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:40:39,106 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:40:39,106 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:40:39,106 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:40:39,106 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:40:39,107 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:40:39,107 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:40:39,107 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:40:39,107 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:40:39,107 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:40:39,108 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:40:39,108 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:40:39,108 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:40:39,109 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:40:39,109 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:40:39,109 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:40:39,109 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:40:39,109 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:40:39,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:40:39,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:40:39,110 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:40:39,110 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:40:39,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:40:39,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:40:39,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:40:39,111 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:40:39,111 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:40:39,111 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:40:39,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:40:39,112 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:40:39,112 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:40:39,112 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:40:39,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:40:39,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:40:39,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:40:39,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:40:39,183 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:40:39,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+nlh-reducer.c [2018-11-12 20:40:39,256 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242936d4d/76f0b1d6b6e141d9830c81488ca4e180/FLAG156f6ea16 [2018-11-12 20:40:39,838 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:40:39,842 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+nlh-reducer.c [2018-11-12 20:40:39,872 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242936d4d/76f0b1d6b6e141d9830c81488ca4e180/FLAG156f6ea16 [2018-11-12 20:40:39,888 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242936d4d/76f0b1d6b6e141d9830c81488ca4e180 [2018-11-12 20:40:39,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:40:39,903 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:40:39,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:40:39,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:40:39,911 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:40:39,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:40:39" (1/1) ... [2018-11-12 20:40:39,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602d4844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:39, skipping insertion in model container [2018-11-12 20:40:39,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:40:39" (1/1) ... [2018-11-12 20:40:39,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:40:40,034 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:40:40,642 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:40:40,652 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:40:40,949 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:40:40,965 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:40:40,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:40 WrapperNode [2018-11-12 20:40:40,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:40:40,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:40:40,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:40:40,968 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:40:40,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:40" (1/1) ... [2018-11-12 20:40:41,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:40" (1/1) ... [2018-11-12 20:40:41,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:40:41,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:40:41,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:40:41,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:40:41,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:40" (1/1) ... [2018-11-12 20:40:41,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:40" (1/1) ... [2018-11-12 20:40:41,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:40" (1/1) ... [2018-11-12 20:40:41,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:40" (1/1) ... [2018-11-12 20:40:41,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:40" (1/1) ... [2018-11-12 20:40:41,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:40" (1/1) ... [2018-11-12 20:40:41,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:40" (1/1) ... [2018-11-12 20:40:41,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:40:41,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:40:41,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:40:41,245 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:40:41,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:40:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:40:41,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:40:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:40:41,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:40:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:40:41,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:40:44,183 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:40:44,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:40:44 BoogieIcfgContainer [2018-11-12 20:40:44,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:40:44,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:40:44,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:40:44,191 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:40:44,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:40:39" (1/3) ... [2018-11-12 20:40:44,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785aca04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:40:44, skipping insertion in model container [2018-11-12 20:40:44,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:40" (2/3) ... [2018-11-12 20:40:44,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785aca04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:40:44, skipping insertion in model container [2018-11-12 20:40:44,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:40:44" (3/3) ... [2018-11-12 20:40:44,196 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+nlh-reducer.c [2018-11-12 20:40:44,204 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:40:44,213 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-12 20:40:44,228 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-12 20:40:44,266 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:40:44,266 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:40:44,267 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:40:44,267 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:40:44,267 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:40:44,267 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:40:44,267 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:40:44,268 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:40:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states. [2018-11-12 20:40:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-12 20:40:44,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:44,303 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:44,306 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:44,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:44,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1490721617, now seen corresponding path program 1 times [2018-11-12 20:40:44,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:44,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:44,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:44,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:44,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:44,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:44,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 20:40:44,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:44,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:40:44,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:40:44,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:40:44,617 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 4 states. [2018-11-12 20:40:46,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:46,084 INFO L93 Difference]: Finished difference Result 319 states and 579 transitions. [2018-11-12 20:40:46,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:40:46,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-12 20:40:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:46,102 INFO L225 Difference]: With dead ends: 319 [2018-11-12 20:40:46,103 INFO L226 Difference]: Without dead ends: 302 [2018-11-12 20:40:46,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-11-12 20:40:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2018-11-12 20:40:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-11-12 20:40:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2018-11-12 20:40:46,175 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 11 [2018-11-12 20:40:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:46,176 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2018-11-12 20:40:46,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:40:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2018-11-12 20:40:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-12 20:40:46,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:46,177 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:46,178 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:46,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:46,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1032267068, now seen corresponding path program 1 times [2018-11-12 20:40:46,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:46,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:46,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:46,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:46,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:46,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:46,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:46,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:46,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:46,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:46,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:46,292 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand 6 states. [2018-11-12 20:40:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:47,782 INFO L93 Difference]: Finished difference Result 309 states and 432 transitions. [2018-11-12 20:40:47,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:47,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-12 20:40:47,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:47,786 INFO L225 Difference]: With dead ends: 309 [2018-11-12 20:40:47,786 INFO L226 Difference]: Without dead ends: 304 [2018-11-12 20:40:47,787 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-12 20:40:47,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2018-11-12 20:40:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-12 20:40:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2018-11-12 20:40:47,808 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2018-11-12 20:40:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:47,809 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2018-11-12 20:40:47,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2018-11-12 20:40:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-12 20:40:47,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:47,810 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:47,810 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:47,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:47,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1016017071, now seen corresponding path program 1 times [2018-11-12 20:40:47,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:47,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:47,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:47,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:47,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:47,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:47,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 20:40:47,874 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:47,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:40:47,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:40:47,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:40:47,875 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand 4 states. [2018-11-12 20:40:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:48,500 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2018-11-12 20:40:48,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:40:48,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-12 20:40:48,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:48,503 INFO L225 Difference]: With dead ends: 297 [2018-11-12 20:40:48,504 INFO L226 Difference]: Without dead ends: 295 [2018-11-12 20:40:48,504 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-12 20:40:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-11-12 20:40:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-11-12 20:40:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2018-11-12 20:40:48,520 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 12 [2018-11-12 20:40:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:48,520 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2018-11-12 20:40:48,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:40:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2018-11-12 20:40:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-12 20:40:48,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:48,521 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:48,522 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:48,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:48,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1431755048, now seen corresponding path program 1 times [2018-11-12 20:40:48,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:48,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:48,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:48,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:48,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:48,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:48,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:48,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:48,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:48,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:48,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:48,600 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand 5 states. [2018-11-12 20:40:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:49,979 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2018-11-12 20:40:49,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:49,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-12 20:40:49,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:49,983 INFO L225 Difference]: With dead ends: 300 [2018-11-12 20:40:49,983 INFO L226 Difference]: Without dead ends: 298 [2018-11-12 20:40:49,984 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-12 20:40:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-11-12 20:40:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-11-12 20:40:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2018-11-12 20:40:49,997 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 13 [2018-11-12 20:40:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:49,998 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2018-11-12 20:40:49,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2018-11-12 20:40:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-12 20:40:49,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:49,999 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:50,000 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:50,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:50,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1526969604, now seen corresponding path program 1 times [2018-11-12 20:40:50,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:50,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:50,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:50,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:50,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:50,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:50,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:50,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:50,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:50,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:50,079 INFO L87 Difference]: Start difference. First operand 298 states and 361 transitions. Second operand 6 states. [2018-11-12 20:40:51,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:51,441 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2018-11-12 20:40:51,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:51,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-12 20:40:51,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:51,446 INFO L225 Difference]: With dead ends: 298 [2018-11-12 20:40:51,446 INFO L226 Difference]: Without dead ends: 296 [2018-11-12 20:40:51,447 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:51,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-12 20:40:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-11-12 20:40:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-11-12 20:40:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2018-11-12 20:40:51,456 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 15 [2018-11-12 20:40:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:51,456 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2018-11-12 20:40:51,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2018-11-12 20:40:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-12 20:40:51,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:51,457 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:51,458 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:51,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:51,458 INFO L82 PathProgramCache]: Analyzing trace with hash -91414371, now seen corresponding path program 1 times [2018-11-12 20:40:51,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:51,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:51,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:51,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:51,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:51,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:51,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:51,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:51,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:51,732 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand 6 states. [2018-11-12 20:40:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:53,197 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2018-11-12 20:40:53,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:53,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-12 20:40:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:53,202 INFO L225 Difference]: With dead ends: 296 [2018-11-12 20:40:53,202 INFO L226 Difference]: Without dead ends: 292 [2018-11-12 20:40:53,203 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:40:53,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-12 20:40:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2018-11-12 20:40:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-12 20:40:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2018-11-12 20:40:53,211 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 16 [2018-11-12 20:40:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:53,212 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2018-11-12 20:40:53,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2018-11-12 20:40:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:40:53,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:53,213 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:53,214 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:53,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:53,214 INFO L82 PathProgramCache]: Analyzing trace with hash -922816985, now seen corresponding path program 1 times [2018-11-12 20:40:53,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:53,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:53,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:53,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:53,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40: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. [2018-11-12 20:40:53,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:53,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-12 20:40:53,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:53,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:40:53,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:40:53,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:53,398 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand 8 states. [2018-11-12 20:40:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:54,693 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2018-11-12 20:40:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:54,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-12 20:40:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:54,696 INFO L225 Difference]: With dead ends: 292 [2018-11-12 20:40:54,697 INFO L226 Difference]: Without dead ends: 290 [2018-11-12 20:40:54,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-11-12 20:40:54,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2018-11-12 20:40:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-12 20:40:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2018-11-12 20:40:54,706 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 17 [2018-11-12 20:40:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:54,706 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2018-11-12 20:40:54,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:40:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2018-11-12 20:40:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:40:54,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:54,707 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:54,708 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:54,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:54,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1474389837, now seen corresponding path program 1 times [2018-11-12 20:40:54,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:54,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:54,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:54,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:54,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:54,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:54,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:54,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:54,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:54,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:54,791 INFO L87 Difference]: Start difference. First operand 287 states and 350 transitions. Second operand 6 states. [2018-11-12 20:40:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:56,025 INFO L93 Difference]: Finished difference Result 307 states and 372 transitions. [2018-11-12 20:40:56,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:56,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-12 20:40:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:56,028 INFO L225 Difference]: With dead ends: 307 [2018-11-12 20:40:56,028 INFO L226 Difference]: Without dead ends: 305 [2018-11-12 20:40:56,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-12 20:40:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 285. [2018-11-12 20:40:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-12 20:40:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 348 transitions. [2018-11-12 20:40:56,037 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 348 transitions. Word has length 17 [2018-11-12 20:40:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:56,038 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 348 transitions. [2018-11-12 20:40:56,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 348 transitions. [2018-11-12 20:40:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:40:56,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:56,039 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:56,039 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:56,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:56,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1475929037, now seen corresponding path program 1 times [2018-11-12 20:40:56,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:56,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:56,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:56,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:56,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:56,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:56,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:56,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:56,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:56,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:56,108 INFO L87 Difference]: Start difference. First operand 285 states and 348 transitions. Second operand 6 states. [2018-11-12 20:40:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:56,813 INFO L93 Difference]: Finished difference Result 288 states and 351 transitions. [2018-11-12 20:40:56,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:56,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-12 20:40:56,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:56,816 INFO L225 Difference]: With dead ends: 288 [2018-11-12 20:40:56,816 INFO L226 Difference]: Without dead ends: 286 [2018-11-12 20:40:56,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-12 20:40:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2018-11-12 20:40:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-12 20:40:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 346 transitions. [2018-11-12 20:40:56,825 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 346 transitions. Word has length 17 [2018-11-12 20:40:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:56,825 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 346 transitions. [2018-11-12 20:40:56,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 346 transitions. [2018-11-12 20:40:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:40:56,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:56,826 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:56,827 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:56,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1537186772, now seen corresponding path program 1 times [2018-11-12 20:40:56,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:56,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:56,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:56,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:56,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:56,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:56,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:56,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:56,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:56,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:56,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:56,909 INFO L87 Difference]: Start difference. First operand 283 states and 346 transitions. Second operand 6 states. [2018-11-12 20:40:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:57,831 INFO L93 Difference]: Finished difference Result 306 states and 371 transitions. [2018-11-12 20:40:57,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:57,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-12 20:40:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:57,835 INFO L225 Difference]: With dead ends: 306 [2018-11-12 20:40:57,835 INFO L226 Difference]: Without dead ends: 304 [2018-11-12 20:40:57,836 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-12 20:40:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 281. [2018-11-12 20:40:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-12 20:40:57,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions. [2018-11-12 20:40:57,844 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 18 [2018-11-12 20:40:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:57,844 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 344 transitions. [2018-11-12 20:40:57,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions. [2018-11-12 20:40:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:40:57,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:57,846 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:57,846 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:57,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1538552192, now seen corresponding path program 1 times [2018-11-12 20:40:57,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:57,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:57,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:57,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:57,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:58,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:58,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-12 20:40:58,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:58,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:40:58,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:40:58,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:58,074 INFO L87 Difference]: Start difference. First operand 281 states and 344 transitions. Second operand 8 states. [2018-11-12 20:40:58,256 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-11-12 20:40:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:59,178 INFO L93 Difference]: Finished difference Result 295 states and 360 transitions. [2018-11-12 20:40:59,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:59,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-12 20:40:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:59,182 INFO L225 Difference]: With dead ends: 295 [2018-11-12 20:40:59,182 INFO L226 Difference]: Without dead ends: 293 [2018-11-12 20:40:59,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-12 20:40:59,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 279. [2018-11-12 20:40:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-12 20:40:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 342 transitions. [2018-11-12 20:40:59,191 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 342 transitions. Word has length 18 [2018-11-12 20:40:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:59,192 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 342 transitions. [2018-11-12 20:40:59,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:40:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 342 transitions. [2018-11-12 20:40:59,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:40:59,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:59,194 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:59,195 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:59,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:59,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1490836942, now seen corresponding path program 1 times [2018-11-12 20:40:59,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:59,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:59,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:59,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:59,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:59,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:59,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:59,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-12 20:40:59,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:59,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:40:59,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:40:59,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:59,436 INFO L87 Difference]: Start difference. First operand 279 states and 342 transitions. Second operand 8 states. [2018-11-12 20:41:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:01,259 INFO L93 Difference]: Finished difference Result 279 states and 342 transitions. [2018-11-12 20:41:01,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:41:01,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-12 20:41:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:01,261 INFO L225 Difference]: With dead ends: 279 [2018-11-12 20:41:01,261 INFO L226 Difference]: Without dead ends: 275 [2018-11-12 20:41:01,262 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:41:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-12 20:41:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-11-12 20:41:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-12 20:41:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 338 transitions. [2018-11-12 20:41:01,270 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 338 transitions. Word has length 18 [2018-11-12 20:41:01,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:01,270 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 338 transitions. [2018-11-12 20:41:01,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:41:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 338 transitions. [2018-11-12 20:41:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-12 20:41:01,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:01,271 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:01,271 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:01,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:01,272 INFO L82 PathProgramCache]: Analyzing trace with hash -408146528, now seen corresponding path program 1 times [2018-11-12 20:41:01,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:01,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:01,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:01,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:01,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:01,568 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-11-12 20:41:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:01,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:01,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-12 20:41:01,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:01,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:41:01,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:41:01,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:41:01,668 INFO L87 Difference]: Start difference. First operand 275 states and 338 transitions. Second operand 8 states. [2018-11-12 20:41:02,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:02,573 INFO L93 Difference]: Finished difference Result 290 states and 355 transitions. [2018-11-12 20:41:02,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:41:02,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-12 20:41:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:02,576 INFO L225 Difference]: With dead ends: 290 [2018-11-12 20:41:02,576 INFO L226 Difference]: Without dead ends: 288 [2018-11-12 20:41:02,577 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:41:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-12 20:41:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 273. [2018-11-12 20:41:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-12 20:41:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 336 transitions. [2018-11-12 20:41:02,584 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 336 transitions. Word has length 19 [2018-11-12 20:41:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:02,584 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 336 transitions. [2018-11-12 20:41:02,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:41:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 336 transitions. [2018-11-12 20:41:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:41:02,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:02,585 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:02,586 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:02,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:02,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1079809725, now seen corresponding path program 1 times [2018-11-12 20:41:02,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:02,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:02,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:02,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:02,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:02,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:02,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 20:41:02,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:02,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:41:02,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:41:02,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:41:02,697 INFO L87 Difference]: Start difference. First operand 273 states and 336 transitions. Second operand 7 states. [2018-11-12 20:41:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:03,327 INFO L93 Difference]: Finished difference Result 276 states and 339 transitions. [2018-11-12 20:41:03,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:41:03,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-12 20:41:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:03,330 INFO L225 Difference]: With dead ends: 276 [2018-11-12 20:41:03,330 INFO L226 Difference]: Without dead ends: 274 [2018-11-12 20:41:03,331 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:41:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-12 20:41:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-11-12 20:41:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-12 20:41:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2018-11-12 20:41:03,337 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 20 [2018-11-12 20:41:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:03,338 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2018-11-12 20:41:03,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:41:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2018-11-12 20:41:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-12 20:41:03,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:03,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:03,339 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:03,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:03,340 INFO L82 PathProgramCache]: Analyzing trace with hash 885640025, now seen corresponding path program 1 times [2018-11-12 20:41:03,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:03,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:03,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:03,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:03,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:03,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:03,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:41:03,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:03,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:41:03,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:41:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:41:03,527 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 6 states. [2018-11-12 20:41:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:04,290 INFO L93 Difference]: Finished difference Result 274 states and 337 transitions. [2018-11-12 20:41:04,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:41:04,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-12 20:41:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:04,293 INFO L225 Difference]: With dead ends: 274 [2018-11-12 20:41:04,293 INFO L226 Difference]: Without dead ends: 254 [2018-11-12 20:41:04,294 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:41:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-12 20:41:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-11-12 20:41:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-12 20:41:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-11-12 20:41:04,299 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 21 [2018-11-12 20:41:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:04,300 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-11-12 20:41:04,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:41:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-11-12 20:41:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-12 20:41:04,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:04,306 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:04,307 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:04,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:04,307 INFO L82 PathProgramCache]: Analyzing trace with hash 317164964, now seen corresponding path program 1 times [2018-11-12 20:41:04,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:04,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:04,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:04,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:04,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:04,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:04,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 20:41:04,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:04,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:41:04,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:41:04,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:41:04,687 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 7 states. [2018-11-12 20:41:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:05,222 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-11-12 20:41:05,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:41:05,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 248 [2018-11-12 20:41:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:05,226 INFO L225 Difference]: With dead ends: 255 [2018-11-12 20:41:05,226 INFO L226 Difference]: Without dead ends: 253 [2018-11-12 20:41:05,227 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:41:05,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-11-12 20:41:05,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2018-11-12 20:41:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-12 20:41:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-11-12 20:41:05,232 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2018-11-12 20:41:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:05,233 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-11-12 20:41:05,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:41:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-11-12 20:41:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-12 20:41:05,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:05,237 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:05,237 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:05,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:05,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1242183539, now seen corresponding path program 1 times [2018-11-12 20:41:05,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:05,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:05,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:05,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:05,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:41:05,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:05,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-12 20:41:05,660 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:05,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:41:05,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:41:05,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:41:05,661 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 8 states. [2018-11-12 20:41:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:06,592 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-11-12 20:41:06,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:41:06,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2018-11-12 20:41:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:06,594 INFO L225 Difference]: With dead ends: 254 [2018-11-12 20:41:06,594 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 20:41:06,597 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:41:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 20:41:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 20:41:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 20:41:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 20:41:06,598 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2018-11-12 20:41:06,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:06,598 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 20:41:06,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:41:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 20:41:06,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 20:41:06,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 20:41:06,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:41:06,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:41:06,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:41:06,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:41:07,196 WARN L179 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2018-11-12 20:41:07,254 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:41:07,254 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:41:07,254 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:41:07,254 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:41:07,254 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-12 20:41:07,255 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:41:07,255 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:41:07,255 INFO L425 ceAbstractionStarter]: For program point L1753(lines 1753 2769) no Hoare annotation was computed. [2018-11-12 20:41:07,255 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 3003) no Hoare annotation was computed. [2018-11-12 20:41:07,255 INFO L425 ceAbstractionStarter]: For program point L630(lines 630 2942) no Hoare annotation was computed. [2018-11-12 20:41:07,255 INFO L425 ceAbstractionStarter]: For program point L564(lines 564 2952) no Hoare annotation was computed. [2018-11-12 20:41:07,255 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-12 20:41:07,255 INFO L425 ceAbstractionStarter]: For program point L2018(lines 2018 2728) no Hoare annotation was computed. [2018-11-12 20:41:07,255 INFO L425 ceAbstractionStarter]: For program point L895(lines 895 2901) no Hoare annotation was computed. [2018-11-12 20:41:07,255 INFO L425 ceAbstractionStarter]: For program point L1160(lines 1160 2860) no Hoare annotation was computed. [2018-11-12 20:41:07,255 INFO L425 ceAbstractionStarter]: For program point L2151(lines 2151 2708) no Hoare annotation was computed. [2018-11-12 20:41:07,256 INFO L425 ceAbstractionStarter]: For program point L2085(lines 2085 2718) no Hoare annotation was computed. [2018-11-12 20:41:07,256 INFO L425 ceAbstractionStarter]: For program point L2416(lines 2416 2667) no Hoare annotation was computed. [2018-11-12 20:41:07,256 INFO L425 ceAbstractionStarter]: For program point L302(lines 302 2992) no Hoare annotation was computed. [2018-11-12 20:41:07,256 INFO L425 ceAbstractionStarter]: For program point L1293(lines 1293 2840) no Hoare annotation was computed. [2018-11-12 20:41:07,256 INFO L425 ceAbstractionStarter]: For program point L1227(lines 1227 2850) no Hoare annotation was computed. [2018-11-12 20:41:07,256 INFO L425 ceAbstractionStarter]: For program point L1558(lines 1558 2799) no Hoare annotation was computed. [2018-11-12 20:41:07,256 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 2972) no Hoare annotation was computed. [2018-11-12 20:41:07,256 INFO L425 ceAbstractionStarter]: For program point L369(lines 369 2982) no Hoare annotation was computed. [2018-11-12 20:41:07,256 INFO L425 ceAbstractionStarter]: For program point L1823(lines 1823 2758) no Hoare annotation was computed. [2018-11-12 20:41:07,256 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 2931) no Hoare annotation was computed. [2018-11-12 20:41:07,257 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 50) no Hoare annotation was computed. [2018-11-12 20:41:07,257 INFO L425 ceAbstractionStarter]: For program point L965(lines 965 2890) no Hoare annotation was computed. [2018-11-12 20:41:07,257 INFO L425 ceAbstractionStarter]: For program point L1956(lines 1956 2738) no Hoare annotation was computed. [2018-11-12 20:41:07,257 INFO L425 ceAbstractionStarter]: For program point L1890(lines 1890 2748) no Hoare annotation was computed. [2018-11-12 20:41:07,257 INFO L425 ceAbstractionStarter]: For program point L2221(lines 2221 2697) no Hoare annotation was computed. [2018-11-12 20:41:07,257 INFO L425 ceAbstractionStarter]: For program point L1098(lines 1098 2870) no Hoare annotation was computed. [2018-11-12 20:41:07,257 INFO L425 ceAbstractionStarter]: For program point L1032(lines 1032 2880) no Hoare annotation was computed. [2018-11-12 20:41:07,257 INFO L425 ceAbstractionStarter]: For program point L2618(lines 2618 2637) no Hoare annotation was computed. [2018-11-12 20:41:07,257 INFO L425 ceAbstractionStarter]: For program point L2486(lines 2486 2656) no Hoare annotation was computed. [2018-11-12 20:41:07,258 INFO L425 ceAbstractionStarter]: For program point L1363(lines 1363 2829) no Hoare annotation was computed. [2018-11-12 20:41:07,258 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-12 20:41:07,258 INFO L425 ceAbstractionStarter]: For program point L1628(lines 1628 2788) no Hoare annotation was computed. [2018-11-12 20:41:07,258 INFO L425 ceAbstractionStarter]: For program point L505(lines 505 2961) no Hoare annotation was computed. [2018-11-12 20:41:07,258 INFO L425 ceAbstractionStarter]: For program point L2553(lines 2553 2646) no Hoare annotation was computed. [2018-11-12 20:41:07,258 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 276) no Hoare annotation was computed. [2018-11-12 20:41:07,258 INFO L425 ceAbstractionStarter]: For program point L770(lines 770 2920) no Hoare annotation was computed. [2018-11-12 20:41:07,258 INFO L425 ceAbstractionStarter]: For program point L1761(lines 1761 2768) no Hoare annotation was computed. [2018-11-12 20:41:07,258 INFO L425 ceAbstractionStarter]: For program point L1695(lines 1695 2778) no Hoare annotation was computed. [2018-11-12 20:41:07,259 INFO L421 ceAbstractionStarter]: At program point L2620(lines 20 2997) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-12 20:41:07,259 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2018-11-12 20:41:07,259 INFO L425 ceAbstractionStarter]: For program point L2026(lines 2026 2727) no Hoare annotation was computed. [2018-11-12 20:41:07,259 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 2900) no Hoare annotation was computed. [2018-11-12 20:41:07,259 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 2910) no Hoare annotation was computed. [2018-11-12 20:41:07,259 INFO L425 ceAbstractionStarter]: For program point L2291(lines 2291 2686) no Hoare annotation was computed. [2018-11-12 20:41:07,259 INFO L425 ceAbstractionStarter]: For program point L1168(lines 1168 2859) no Hoare annotation was computed. [2018-11-12 20:41:07,259 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2018-11-12 20:41:07,259 INFO L425 ceAbstractionStarter]: For program point L1433(lines 1433 2818) no Hoare annotation was computed. [2018-11-12 20:41:07,259 INFO L425 ceAbstractionStarter]: For program point L2424(lines 2424 2666) no Hoare annotation was computed. [2018-11-12 20:41:07,260 INFO L425 ceAbstractionStarter]: For program point L2358(lines 2358 2676) no Hoare annotation was computed. [2018-11-12 20:41:07,260 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 2991) no Hoare annotation was computed. [2018-11-12 20:41:07,260 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2018-11-12 20:41:07,260 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-12 20:41:07,260 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 2950) no Hoare annotation was computed. [2018-11-12 20:41:07,260 INFO L425 ceAbstractionStarter]: For program point L1566(lines 1566 2798) no Hoare annotation was computed. [2018-11-12 20:41:07,260 INFO L425 ceAbstractionStarter]: For program point L1500(lines 1500 2808) no Hoare annotation was computed. [2018-11-12 20:41:07,260 INFO L425 ceAbstractionStarter]: For program point L1831(lines 1831 2757) no Hoare annotation was computed. [2018-11-12 20:41:07,260 INFO L425 ceAbstractionStarter]: For program point L708(lines 708 2930) no Hoare annotation was computed. [2018-11-12 20:41:07,260 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 2940) no Hoare annotation was computed. [2018-11-12 20:41:07,260 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-12 20:41:07,261 INFO L425 ceAbstractionStarter]: For program point L2096(lines 2096 2716) no Hoare annotation was computed. [2018-11-12 20:41:07,261 INFO L425 ceAbstractionStarter]: For program point L973(lines 973 2889) no Hoare annotation was computed. [2018-11-12 20:41:07,261 INFO L425 ceAbstractionStarter]: For program point L1238(lines 1238 2848) no Hoare annotation was computed. [2018-11-12 20:41:07,261 INFO L425 ceAbstractionStarter]: For program point L2229(lines 2229 2696) no Hoare annotation was computed. [2018-11-12 20:41:07,261 INFO L425 ceAbstractionStarter]: For program point L2163(lines 2163 2706) no Hoare annotation was computed. [2018-11-12 20:41:07,261 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2018-11-12 20:41:07,261 INFO L425 ceAbstractionStarter]: For program point L2626(lines 2626 2636) no Hoare annotation was computed. [2018-11-12 20:41:07,261 INFO L425 ceAbstractionStarter]: For program point L2494(lines 2494 2655) no Hoare annotation was computed. [2018-11-12 20:41:07,261 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 2980) no Hoare annotation was computed. [2018-11-12 20:41:07,261 INFO L425 ceAbstractionStarter]: For program point L1371(lines 1371 2828) no Hoare annotation was computed. [2018-11-12 20:41:07,262 INFO L425 ceAbstractionStarter]: For program point L1305(lines 1305 2838) no Hoare annotation was computed. [2018-11-12 20:41:07,262 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 270) no Hoare annotation was computed. [2018-11-12 20:41:07,262 INFO L425 ceAbstractionStarter]: For program point L1636(lines 1636 2787) no Hoare annotation was computed. [2018-11-12 20:41:07,262 INFO L425 ceAbstractionStarter]: For program point L513(lines 513 2960) no Hoare annotation was computed. [2018-11-12 20:41:07,262 INFO L425 ceAbstractionStarter]: For program point L447(lines 447 2970) no Hoare annotation was computed. [2018-11-12 20:41:07,262 INFO L425 ceAbstractionStarter]: For program point L1901(lines 1901 2746) no Hoare annotation was computed. [2018-11-12 20:41:07,262 INFO L425 ceAbstractionStarter]: For program point L778(lines 778 2919) no Hoare annotation was computed. [2018-11-12 20:41:07,262 INFO L425 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2018-11-12 20:41:07,262 INFO L425 ceAbstractionStarter]: For program point L1043(lines 1043 2878) no Hoare annotation was computed. [2018-11-12 20:41:07,262 INFO L425 ceAbstractionStarter]: For program point L2034(lines 2034 2726) no Hoare annotation was computed. [2018-11-12 20:41:07,263 INFO L425 ceAbstractionStarter]: For program point L1968(lines 1968 2736) no Hoare annotation was computed. [2018-11-12 20:41:07,263 INFO L421 ceAbstractionStarter]: At program point L2629(lines 59 2996) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (<= 0 main_~main__t~0)) [2018-11-12 20:41:07,263 INFO L425 ceAbstractionStarter]: For program point L2299(lines 2299 2685) no Hoare annotation was computed. [2018-11-12 20:41:07,263 INFO L425 ceAbstractionStarter]: For program point L1176(lines 1176 2858) no Hoare annotation was computed. [2018-11-12 20:41:07,263 INFO L425 ceAbstractionStarter]: For program point L1110(lines 1110 2868) no Hoare annotation was computed. [2018-11-12 20:41:07,263 INFO L425 ceAbstractionStarter]: For program point L2564(lines 2564 2644) no Hoare annotation was computed. [2018-11-12 20:41:07,264 INFO L425 ceAbstractionStarter]: For program point L1441(lines 1441 2817) no Hoare annotation was computed. [2018-11-12 20:41:07,264 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 2990) no Hoare annotation was computed. [2018-11-12 20:41:07,264 INFO L425 ceAbstractionStarter]: For program point L1706(lines 1706 2776) no Hoare annotation was computed. [2018-11-12 20:41:07,264 INFO L425 ceAbstractionStarter]: For program point L583(lines 583 2949) no Hoare annotation was computed. [2018-11-12 20:41:07,264 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 2908) no Hoare annotation was computed. [2018-11-12 20:41:07,264 INFO L425 ceAbstractionStarter]: For program point L1839(lines 1839 2756) no Hoare annotation was computed. [2018-11-12 20:41:07,264 INFO L425 ceAbstractionStarter]: For program point L1773(lines 1773 2766) no Hoare annotation was computed. [2018-11-12 20:41:07,264 INFO L425 ceAbstractionStarter]: For program point L2104(lines 2104 2715) no Hoare annotation was computed. [2018-11-12 20:41:07,265 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 2888) no Hoare annotation was computed. [2018-11-12 20:41:07,265 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 2898) no Hoare annotation was computed. [2018-11-12 20:41:07,265 INFO L425 ceAbstractionStarter]: For program point L2369(lines 2369 2674) no Hoare annotation was computed. [2018-11-12 20:41:07,265 INFO L425 ceAbstractionStarter]: For program point L1246(lines 1246 2847) no Hoare annotation was computed. [2018-11-12 20:41:07,265 INFO L425 ceAbstractionStarter]: For program point L1511(lines 1511 2806) no Hoare annotation was computed. [2018-11-12 20:41:07,265 INFO L425 ceAbstractionStarter]: For program point L2502(lines 2502 2654) no Hoare annotation was computed. [2018-11-12 20:41:07,265 INFO L425 ceAbstractionStarter]: For program point L2436(lines 2436 2664) no Hoare annotation was computed. [2018-11-12 20:41:07,265 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 2979) no Hoare annotation was computed. [2018-11-12 20:41:07,265 INFO L425 ceAbstractionStarter]: For program point L653(lines 653 2938) no Hoare annotation was computed. [2018-11-12 20:41:07,266 INFO L425 ceAbstractionStarter]: For program point L1644(lines 1644 2786) no Hoare annotation was computed. [2018-11-12 20:41:07,266 INFO L425 ceAbstractionStarter]: For program point L1578(lines 1578 2796) no Hoare annotation was computed. [2018-11-12 20:41:07,266 INFO L421 ceAbstractionStarter]: At program point L2635(lines 2586 2642) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~14 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2018-11-12 20:41:07,266 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 2996) no Hoare annotation was computed. [2018-11-12 20:41:07,266 INFO L425 ceAbstractionStarter]: For program point L1909(lines 1909 2745) no Hoare annotation was computed. [2018-11-12 20:41:07,266 INFO L425 ceAbstractionStarter]: For program point L786(lines 786 2918) no Hoare annotation was computed. [2018-11-12 20:41:07,267 INFO L425 ceAbstractionStarter]: For program point L720(lines 720 2928) no Hoare annotation was computed. [2018-11-12 20:41:07,267 INFO L425 ceAbstractionStarter]: For program point L2174(lines 2174 2704) no Hoare annotation was computed. [2018-11-12 20:41:07,267 INFO L425 ceAbstractionStarter]: For program point L1051(lines 1051 2877) no Hoare annotation was computed. [2018-11-12 20:41:07,267 INFO L425 ceAbstractionStarter]: For program point L1316(lines 1316 2836) no Hoare annotation was computed. [2018-11-12 20:41:07,267 INFO L425 ceAbstractionStarter]: For program point L2307(lines 2307 2684) no Hoare annotation was computed. [2018-11-12 20:41:07,267 INFO L425 ceAbstractionStarter]: For program point L2241(lines 2241 2694) no Hoare annotation was computed. [2018-11-12 20:41:07,267 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 277) no Hoare annotation was computed. [2018-11-12 20:41:07,267 INFO L425 ceAbstractionStarter]: For program point L2572(lines 2572 2643) no Hoare annotation was computed. [2018-11-12 20:41:07,267 INFO L425 ceAbstractionStarter]: For program point L458(lines 458 2968) no Hoare annotation was computed. [2018-11-12 20:41:07,268 INFO L425 ceAbstractionStarter]: For program point L1449(lines 1449 2816) no Hoare annotation was computed. [2018-11-12 20:41:07,268 INFO L425 ceAbstractionStarter]: For program point L1383(lines 1383 2826) no Hoare annotation was computed. [2018-11-12 20:41:07,268 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 268) no Hoare annotation was computed. [2018-11-12 20:41:07,268 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2018-11-12 20:41:07,268 INFO L425 ceAbstractionStarter]: For program point L1714(lines 1714 2775) no Hoare annotation was computed. [2018-11-12 20:41:07,268 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 2948) no Hoare annotation was computed. [2018-11-12 20:41:07,268 INFO L425 ceAbstractionStarter]: For program point L525(lines 525 2958) no Hoare annotation was computed. [2018-11-12 20:41:07,269 INFO L425 ceAbstractionStarter]: For program point L1979(lines 1979 2734) no Hoare annotation was computed. [2018-11-12 20:41:07,269 INFO L425 ceAbstractionStarter]: For program point L856(lines 856 2907) no Hoare annotation was computed. [2018-11-12 20:41:07,269 INFO L425 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2018-11-12 20:41:07,269 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2018-11-12 20:41:07,269 INFO L425 ceAbstractionStarter]: For program point L1121(lines 1121 2866) no Hoare annotation was computed. [2018-11-12 20:41:07,269 INFO L425 ceAbstractionStarter]: For program point L2112(lines 2112 2714) no Hoare annotation was computed. [2018-11-12 20:41:07,269 INFO L425 ceAbstractionStarter]: For program point L2046(lines 2046 2724) no Hoare annotation was computed. [2018-11-12 20:41:07,270 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2018-11-12 20:41:07,270 INFO L425 ceAbstractionStarter]: For program point L2377(lines 2377 2673) no Hoare annotation was computed. [2018-11-12 20:41:07,270 INFO L425 ceAbstractionStarter]: For program point L1254(lines 1254 2846) no Hoare annotation was computed. [2018-11-12 20:41:07,270 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2018-11-12 20:41:07,270 INFO L425 ceAbstractionStarter]: For program point L1188(lines 1188 2856) no Hoare annotation was computed. [2018-11-12 20:41:07,270 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 235) no Hoare annotation was computed. [2018-11-12 20:41:07,270 INFO L425 ceAbstractionStarter]: For program point L1519(lines 1519 2805) no Hoare annotation was computed. [2018-11-12 20:41:07,270 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 2978) no Hoare annotation was computed. [2018-11-12 20:41:07,271 INFO L425 ceAbstractionStarter]: For program point L330(lines 330 2988) no Hoare annotation was computed. [2018-11-12 20:41:07,271 INFO L425 ceAbstractionStarter]: For program point L1784(lines 1784 2764) no Hoare annotation was computed. [2018-11-12 20:41:07,271 INFO L425 ceAbstractionStarter]: For program point L661(lines 661 2937) no Hoare annotation was computed. [2018-11-12 20:41:07,271 INFO L425 ceAbstractionStarter]: For program point L926(lines 926 2896) no Hoare annotation was computed. [2018-11-12 20:41:07,271 INFO L425 ceAbstractionStarter]: For program point L1917(lines 1917 2744) no Hoare annotation was computed. [2018-11-12 20:41:07,271 INFO L425 ceAbstractionStarter]: For program point L1851(lines 1851 2754) no Hoare annotation was computed. [2018-11-12 20:41:07,271 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 224) no Hoare annotation was computed. [2018-11-12 20:41:07,271 INFO L425 ceAbstractionStarter]: For program point L2182(lines 2182 2703) no Hoare annotation was computed. [2018-11-12 20:41:07,271 INFO L425 ceAbstractionStarter]: For program point L1059(lines 1059 2876) no Hoare annotation was computed. [2018-11-12 20:41:07,272 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 2886) no Hoare annotation was computed. [2018-11-12 20:41:07,272 INFO L425 ceAbstractionStarter]: For program point L2447(lines 2447 2662) no Hoare annotation was computed. [2018-11-12 20:41:07,272 INFO L425 ceAbstractionStarter]: For program point L1324(lines 1324 2835) no Hoare annotation was computed. [2018-11-12 20:41:07,272 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 281) no Hoare annotation was computed. [2018-11-12 20:41:07,272 INFO L425 ceAbstractionStarter]: For program point L1589(lines 1589 2794) no Hoare annotation was computed. [2018-11-12 20:41:07,272 INFO L425 ceAbstractionStarter]: For program point L2580(lines 2580 2642) no Hoare annotation was computed. [2018-11-12 20:41:07,272 INFO L425 ceAbstractionStarter]: For program point L2514(lines 2514 2652) no Hoare annotation was computed. [2018-11-12 20:41:07,272 INFO L425 ceAbstractionStarter]: For program point L466(lines 466 2967) no Hoare annotation was computed. [2018-11-12 20:41:07,272 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-12 20:41:07,273 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 2926) no Hoare annotation was computed. [2018-11-12 20:41:07,273 INFO L425 ceAbstractionStarter]: For program point L1722(lines 1722 2774) no Hoare annotation was computed. [2018-11-12 20:41:07,273 INFO L425 ceAbstractionStarter]: For program point L1656(lines 1656 2784) no Hoare annotation was computed. [2018-11-12 20:41:07,273 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 3003) no Hoare annotation was computed. [2018-11-12 20:41:07,273 INFO L425 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-11-12 20:41:07,273 INFO L425 ceAbstractionStarter]: For program point L1987(lines 1987 2733) no Hoare annotation was computed. [2018-11-12 20:41:07,273 INFO L425 ceAbstractionStarter]: For program point L864(lines 864 2906) no Hoare annotation was computed. [2018-11-12 20:41:07,274 INFO L425 ceAbstractionStarter]: For program point L798(lines 798 2916) no Hoare annotation was computed. [2018-11-12 20:41:07,274 INFO L425 ceAbstractionStarter]: For program point L2252(lines 2252 2692) no Hoare annotation was computed. [2018-11-12 20:41:07,274 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 229) no Hoare annotation was computed. [2018-11-12 20:41:07,274 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 262) no Hoare annotation was computed. [2018-11-12 20:41:07,274 INFO L425 ceAbstractionStarter]: For program point L1129(lines 1129 2865) no Hoare annotation was computed. [2018-11-12 20:41:07,274 INFO L425 ceAbstractionStarter]: For program point L1394(lines 1394 2824) no Hoare annotation was computed. [2018-11-12 20:41:07,274 INFO L425 ceAbstractionStarter]: For program point L2385(lines 2385 2672) no Hoare annotation was computed. [2018-11-12 20:41:07,274 INFO L425 ceAbstractionStarter]: For program point L2319(lines 2319 2682) no Hoare annotation was computed. [2018-11-12 20:41:07,275 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2018-11-12 20:41:07,275 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 2956) no Hoare annotation was computed. [2018-11-12 20:41:07,275 INFO L425 ceAbstractionStarter]: For program point L1527(lines 1527 2804) no Hoare annotation was computed. [2018-11-12 20:41:07,275 INFO L425 ceAbstractionStarter]: For program point L1461(lines 1461 2814) no Hoare annotation was computed. [2018-11-12 20:41:07,275 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-12 20:41:07,275 INFO L425 ceAbstractionStarter]: For program point L1792(lines 1792 2763) no Hoare annotation was computed. [2018-11-12 20:41:07,275 INFO L425 ceAbstractionStarter]: For program point L669(lines 669 2936) no Hoare annotation was computed. [2018-11-12 20:41:07,275 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 2946) no Hoare annotation was computed. [2018-11-12 20:41:07,276 INFO L425 ceAbstractionStarter]: For program point L2057(lines 2057 2722) no Hoare annotation was computed. [2018-11-12 20:41:07,276 INFO L425 ceAbstractionStarter]: For program point L934(lines 934 2895) no Hoare annotation was computed. [2018-11-12 20:41:07,276 INFO L425 ceAbstractionStarter]: For program point L1199(lines 1199 2854) no Hoare annotation was computed. [2018-11-12 20:41:07,276 INFO L425 ceAbstractionStarter]: For program point L2190(lines 2190 2702) no Hoare annotation was computed. [2018-11-12 20:41:07,276 INFO L425 ceAbstractionStarter]: For program point L2124(lines 2124 2712) no Hoare annotation was computed. [2018-11-12 20:41:07,276 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-11-12 20:41:07,276 INFO L425 ceAbstractionStarter]: For program point L2455(lines 2455 2661) no Hoare annotation was computed. [2018-11-12 20:41:07,276 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 2986) no Hoare annotation was computed. [2018-11-12 20:41:07,277 INFO L425 ceAbstractionStarter]: For program point L1332(lines 1332 2834) no Hoare annotation was computed. [2018-11-12 20:41:07,277 INFO L421 ceAbstractionStarter]: At program point L275(lines 127 277) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~3)) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= 1 main_~__VERIFIER_assert__cond~2) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (<= 1 main_~main__t~0)) [2018-11-12 20:41:07,277 INFO L425 ceAbstractionStarter]: For program point L1266(lines 1266 2844) no Hoare annotation was computed. [2018-11-12 20:41:07,277 INFO L425 ceAbstractionStarter]: For program point L1597(lines 1597 2793) no Hoare annotation was computed. [2018-11-12 20:41:07,277 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 2966) no Hoare annotation was computed. [2018-11-12 20:41:07,277 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 2976) no Hoare annotation was computed. [2018-11-12 20:41:07,277 INFO L425 ceAbstractionStarter]: For program point L1862(lines 1862 2752) no Hoare annotation was computed. [2018-11-12 20:41:07,277 INFO L425 ceAbstractionStarter]: For program point L739(lines 739 2925) no Hoare annotation was computed. [2018-11-12 20:41:07,278 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-11-12 20:41:07,278 INFO L425 ceAbstractionStarter]: For program point L1004(lines 1004 2884) no Hoare annotation was computed. [2018-11-12 20:41:07,278 INFO L425 ceAbstractionStarter]: For program point L1995(lines 1995 2732) no Hoare annotation was computed. [2018-11-12 20:41:07,278 INFO L425 ceAbstractionStarter]: For program point L1929(lines 1929 2742) no Hoare annotation was computed. [2018-11-12 20:41:07,278 INFO L425 ceAbstractionStarter]: For program point L2260(lines 2260 2691) no Hoare annotation was computed. [2018-11-12 20:41:07,278 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 222) no Hoare annotation was computed. [2018-11-12 20:41:07,278 INFO L425 ceAbstractionStarter]: For program point L1137(lines 1137 2864) no Hoare annotation was computed. [2018-11-12 20:41:07,278 INFO L425 ceAbstractionStarter]: For program point L1071(lines 1071 2874) no Hoare annotation was computed. [2018-11-12 20:41:07,279 INFO L425 ceAbstractionStarter]: For program point L2525(lines 2525 2650) no Hoare annotation was computed. [2018-11-12 20:41:07,279 INFO L425 ceAbstractionStarter]: For program point L1402(lines 1402 2823) no Hoare annotation was computed. [2018-11-12 20:41:07,279 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 279) no Hoare annotation was computed. [2018-11-12 20:41:07,279 INFO L425 ceAbstractionStarter]: For program point L1667(lines 1667 2782) no Hoare annotation was computed. [2018-11-12 20:41:07,279 INFO L425 ceAbstractionStarter]: For program point L544(lines 544 2955) no Hoare annotation was computed. [2018-11-12 20:41:07,279 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2599) no Hoare annotation was computed. [2018-11-12 20:41:07,279 INFO L425 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-11-12 20:41:07,279 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 3002) no Hoare annotation was computed. [2018-11-12 20:41:07,280 INFO L425 ceAbstractionStarter]: For program point L809(lines 809 2914) no Hoare annotation was computed. [2018-11-12 20:41:07,280 INFO L425 ceAbstractionStarter]: For program point L1800(lines 1800 2762) no Hoare annotation was computed. [2018-11-12 20:41:07,280 INFO L425 ceAbstractionStarter]: For program point L1734(lines 1734 2772) no Hoare annotation was computed. [2018-11-12 20:41:07,280 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2018-11-12 20:41:07,280 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2611) no Hoare annotation was computed. [2018-11-12 20:41:07,280 INFO L425 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-12 20:41:07,280 INFO L425 ceAbstractionStarter]: For program point L2065(lines 2065 2721) no Hoare annotation was computed. [2018-11-12 20:41:07,280 INFO L425 ceAbstractionStarter]: For program point L942(lines 942 2894) no Hoare annotation was computed. [2018-11-12 20:41:07,281 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 2904) no Hoare annotation was computed. [2018-11-12 20:41:07,281 INFO L425 ceAbstractionStarter]: For program point L2330(lines 2330 2680) no Hoare annotation was computed. [2018-11-12 20:41:07,281 INFO L425 ceAbstractionStarter]: For program point L1207(lines 1207 2853) no Hoare annotation was computed. [2018-11-12 20:41:07,281 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 227) no Hoare annotation was computed. [2018-11-12 20:41:07,281 INFO L425 ceAbstractionStarter]: For program point L1472(lines 1472 2812) no Hoare annotation was computed. [2018-11-12 20:41:07,281 INFO L425 ceAbstractionStarter]: For program point L2463(lines 2463 2660) no Hoare annotation was computed. [2018-11-12 20:41:07,281 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 2985) no Hoare annotation was computed. [2018-11-12 20:41:07,281 INFO L425 ceAbstractionStarter]: For program point L2397(lines 2397 2670) no Hoare annotation was computed. [2018-11-12 20:41:07,281 INFO L425 ceAbstractionStarter]: For program point L614(lines 614 2944) no Hoare annotation was computed. [2018-11-12 20:41:07,282 INFO L425 ceAbstractionStarter]: For program point L1605(lines 1605 2792) no Hoare annotation was computed. [2018-11-12 20:41:07,282 INFO L425 ceAbstractionStarter]: For program point L1539(lines 1539 2802) no Hoare annotation was computed. [2018-11-12 20:41:07,282 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-12 20:41:07,282 INFO L425 ceAbstractionStarter]: For program point L20(lines 20 2997) no Hoare annotation was computed. [2018-11-12 20:41:07,282 INFO L425 ceAbstractionStarter]: For program point L1870(lines 1870 2751) no Hoare annotation was computed. [2018-11-12 20:41:07,282 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 2924) no Hoare annotation was computed. [2018-11-12 20:41:07,282 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 2934) no Hoare annotation was computed. [2018-11-12 20:41:07,282 INFO L425 ceAbstractionStarter]: For program point L2597(lines 2597 2640) no Hoare annotation was computed. [2018-11-12 20:41:07,282 INFO L425 ceAbstractionStarter]: For program point L2135(lines 2135 2710) no Hoare annotation was computed. [2018-11-12 20:41:07,283 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 2883) no Hoare annotation was computed. [2018-11-12 20:41:07,283 INFO L425 ceAbstractionStarter]: For program point L1277(lines 1277 2842) no Hoare annotation was computed. [2018-11-12 20:41:07,283 INFO L425 ceAbstractionStarter]: For program point L2268(lines 2268 2690) no Hoare annotation was computed. [2018-11-12 20:41:07,283 INFO L425 ceAbstractionStarter]: For program point L2202(lines 2202 2700) no Hoare annotation was computed. [2018-11-12 20:41:07,283 INFO L425 ceAbstractionStarter]: For program point L2599(line 2599) no Hoare annotation was computed. [2018-11-12 20:41:07,283 INFO L425 ceAbstractionStarter]: For program point L2533(lines 2533 2649) no Hoare annotation was computed. [2018-11-12 20:41:07,283 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 2974) no Hoare annotation was computed. [2018-11-12 20:41:07,283 INFO L425 ceAbstractionStarter]: For program point L1410(lines 1410 2822) no Hoare annotation was computed. [2018-11-12 20:41:07,284 INFO L425 ceAbstractionStarter]: For program point L1344(lines 1344 2832) no Hoare annotation was computed. [2018-11-12 20:41:07,284 INFO L421 ceAbstractionStarter]: At program point L221(lines 87 279) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~3)) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~2 1) (<= 1 main_~main__t~0)) [2018-11-12 20:41:07,284 INFO L425 ceAbstractionStarter]: For program point L1675(lines 1675 2781) no Hoare annotation was computed. [2018-11-12 20:41:07,284 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 2954) no Hoare annotation was computed. [2018-11-12 20:41:07,284 INFO L425 ceAbstractionStarter]: For program point L486(lines 486 2964) no Hoare annotation was computed. [2018-11-12 20:41:07,284 INFO L425 ceAbstractionStarter]: For program point L1940(lines 1940 2740) no Hoare annotation was computed. [2018-11-12 20:41:07,284 INFO L425 ceAbstractionStarter]: For program point L817(lines 817 2913) no Hoare annotation was computed. [2018-11-12 20:41:07,284 INFO L425 ceAbstractionStarter]: For program point L1082(lines 1082 2872) no Hoare annotation was computed. [2018-11-12 20:41:07,285 INFO L425 ceAbstractionStarter]: For program point L2073(lines 2073 2720) no Hoare annotation was computed. [2018-11-12 20:41:07,285 INFO L425 ceAbstractionStarter]: For program point L2007(lines 2007 2730) no Hoare annotation was computed. [2018-11-12 20:41:07,285 INFO L425 ceAbstractionStarter]: For program point L2338(lines 2338 2679) no Hoare annotation was computed. [2018-11-12 20:41:07,285 INFO L425 ceAbstractionStarter]: For program point L1215(lines 1215 2852) no Hoare annotation was computed. [2018-11-12 20:41:07,285 INFO L425 ceAbstractionStarter]: For program point L1149(lines 1149 2862) no Hoare annotation was computed. [2018-11-12 20:41:07,285 INFO L425 ceAbstractionStarter]: For program point L1480(lines 1480 2811) no Hoare annotation was computed. [2018-11-12 20:41:07,285 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 2984) no Hoare annotation was computed. [2018-11-12 20:41:07,285 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2018-11-12 20:41:07,286 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 2994) no Hoare annotation was computed. [2018-11-12 20:41:07,286 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 226) no Hoare annotation was computed. [2018-11-12 20:41:07,286 INFO L425 ceAbstractionStarter]: For program point L1745(lines 1745 2770) no Hoare annotation was computed. [2018-11-12 20:41:07,286 INFO L425 ceAbstractionStarter]: For program point L622(lines 622 2943) no Hoare annotation was computed. [2018-11-12 20:41:07,286 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2018-11-12 20:41:07,286 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2018-11-12 20:41:07,287 INFO L425 ceAbstractionStarter]: For program point L28(lines 28 52) no Hoare annotation was computed. [2018-11-12 20:41:07,287 INFO L428 ceAbstractionStarter]: At program point L3001(lines 16 3002) the Hoare annotation is: true [2018-11-12 20:41:07,287 INFO L425 ceAbstractionStarter]: For program point L887(lines 887 2902) no Hoare annotation was computed. [2018-11-12 20:41:07,287 INFO L425 ceAbstractionStarter]: For program point L1878(lines 1878 2750) no Hoare annotation was computed. [2018-11-12 20:41:07,287 INFO L425 ceAbstractionStarter]: For program point L1812(lines 1812 2760) no Hoare annotation was computed. [2018-11-12 20:41:07,287 INFO L425 ceAbstractionStarter]: For program point L2143(lines 2143 2709) no Hoare annotation was computed. [2018-11-12 20:41:07,287 INFO L425 ceAbstractionStarter]: For program point L1020(lines 1020 2882) no Hoare annotation was computed. [2018-11-12 20:41:07,287 INFO L425 ceAbstractionStarter]: For program point L954(lines 954 2892) no Hoare annotation was computed. [2018-11-12 20:41:07,287 INFO L425 ceAbstractionStarter]: For program point L2408(lines 2408 2668) no Hoare annotation was computed. [2018-11-12 20:41:07,287 INFO L425 ceAbstractionStarter]: For program point L1285(lines 1285 2841) no Hoare annotation was computed. [2018-11-12 20:41:07,288 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-11-12 20:41:07,288 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 3003) the Hoare annotation is: true [2018-11-12 20:41:07,288 INFO L425 ceAbstractionStarter]: For program point L1550(lines 1550 2800) no Hoare annotation was computed. [2018-11-12 20:41:07,288 INFO L425 ceAbstractionStarter]: For program point L2541(lines 2541 2648) no Hoare annotation was computed. [2018-11-12 20:41:07,288 INFO L425 ceAbstractionStarter]: For program point L427(lines 427 2973) no Hoare annotation was computed. [2018-11-12 20:41:07,288 INFO L425 ceAbstractionStarter]: For program point L2475(lines 2475 2658) no Hoare annotation was computed. [2018-11-12 20:41:07,288 INFO L425 ceAbstractionStarter]: For program point L692(lines 692 2932) no Hoare annotation was computed. [2018-11-12 20:41:07,288 INFO L425 ceAbstractionStarter]: For program point L1683(lines 1683 2780) no Hoare annotation was computed. [2018-11-12 20:41:07,288 INFO L425 ceAbstractionStarter]: For program point L1617(lines 1617 2790) no Hoare annotation was computed. [2018-11-12 20:41:07,288 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2018-11-12 20:41:07,288 INFO L425 ceAbstractionStarter]: For program point L1948(lines 1948 2739) no Hoare annotation was computed. [2018-11-12 20:41:07,288 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 2912) no Hoare annotation was computed. [2018-11-12 20:41:07,289 INFO L425 ceAbstractionStarter]: For program point L759(lines 759 2922) no Hoare annotation was computed. [2018-11-12 20:41:07,289 INFO L425 ceAbstractionStarter]: For program point L2609(lines 2609 2638) no Hoare annotation was computed. [2018-11-12 20:41:07,289 INFO L425 ceAbstractionStarter]: For program point L2213(lines 2213 2698) no Hoare annotation was computed. [2018-11-12 20:41:07,289 INFO L425 ceAbstractionStarter]: For program point L1090(lines 1090 2871) no Hoare annotation was computed. [2018-11-12 20:41:07,289 INFO L425 ceAbstractionStarter]: For program point L1355(lines 1355 2830) no Hoare annotation was computed. [2018-11-12 20:41:07,289 INFO L425 ceAbstractionStarter]: For program point L2346(lines 2346 2678) no Hoare annotation was computed. [2018-11-12 20:41:07,289 INFO L425 ceAbstractionStarter]: For program point L2280(lines 2280 2688) no Hoare annotation was computed. [2018-11-12 20:41:07,289 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2018-11-12 20:41:07,289 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-12 20:41:07,289 INFO L425 ceAbstractionStarter]: For program point L2611(line 2611) no Hoare annotation was computed. [2018-11-12 20:41:07,289 INFO L425 ceAbstractionStarter]: For program point L497(lines 497 2962) no Hoare annotation was computed. [2018-11-12 20:41:07,289 INFO L425 ceAbstractionStarter]: For program point L1488(lines 1488 2810) no Hoare annotation was computed. [2018-11-12 20:41:07,290 INFO L425 ceAbstractionStarter]: For program point L1422(lines 1422 2820) no Hoare annotation was computed. [2018-11-12 20:41:07,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:41:07 BoogieIcfgContainer [2018-11-12 20:41:07,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:41:07,308 INFO L168 Benchmark]: Toolchain (without parser) took 27407.07 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -187.9 MB). Peak memory consumption was 863.8 MB. Max. memory is 7.1 GB. [2018-11-12 20:41:07,309 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:41:07,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1062.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:41:07,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 159.56 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 699.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.8 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2018-11-12 20:41:07,311 INFO L168 Benchmark]: Boogie Preprocessor took 117.14 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:41:07,312 INFO L168 Benchmark]: RCFGBuilder took 2939.56 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 161.3 MB). Peak memory consumption was 161.3 MB. Max. memory is 7.1 GB. [2018-11-12 20:41:07,313 INFO L168 Benchmark]: TraceAbstraction took 23120.13 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 351.8 MB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 396.8 MB). Peak memory consumption was 748.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:41:07,321 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1062.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 159.56 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 699.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.8 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.14 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 2939.56 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 161.3 MB). Peak memory consumption was 161.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23120.13 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 351.8 MB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 396.8 MB). Peak memory consumption was 748.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 30]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2611]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 262]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2599]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__t == main__tagbuf_len)) && 0 <= main__t - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && main__t <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && 1 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((!(0 == __VERIFIER_assert__cond) && main__t <= main__tagbuf_len) && 1 == __VERIFIER_assert__cond) && !(main__t == main__tagbuf_len)) && 1 <= main__t - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && __VERIFIER_assert__cond == 1) && !(main__tagbuf_len == main__t)) && 1 <= main__t - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 309 locations, 16 error locations. SAFE Result, 23.0s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 18.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1817 SDtfs, 9677 SDslu, 3271 SDs, 0 SdLazy, 13451 SolverSat, 2536 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 89 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 71 HoareAnnotationTreeSize, 10 FomulaSimplifications, 2903 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 86 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 724 ConstructedInterpolants, 0 QuantifiedInterpolants, 145229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...