java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:05:05,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:05:05,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:05:05,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:05:05,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:05:05,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:05:05,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:05:05,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:05:05,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:05:05,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:05:05,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:05:05,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:05:05,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:05:05,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:05:05,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:05:05,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:05:05,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:05:05,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:05:05,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:05:05,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:05:05,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:05:05,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:05:05,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:05:05,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:05:05,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:05:05,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:05:05,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:05:05,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:05:05,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:05:05,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:05:05,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:05:05,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:05:05,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:05:05,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:05:05,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:05:05,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:05:05,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:05:05,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:05:05,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:05:05,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:05:05,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:05:05,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:05:05,519 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:05:05,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:05:05,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:05:05,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:05:05,521 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:05:05,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:05:05,522 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:05:05,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:05:05,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:05:05,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:05:05,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:05:05,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:05:05,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:05:05,523 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:05:05,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:05:05,523 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:05:05,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:05:05,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:05:05,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:05:05,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:05:05,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:05:05,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:05:05,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:05:05,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:05:05,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:05:05,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:05:05,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:05:05,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:05:05,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:05:05,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:05:05,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:05:05,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:05:05,802 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:05:05,802 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:05:05,803 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-10-15 01:05:05,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919987bab/aff99c76acc04cd39a7561c965ff75d5/FLAG3646034a5 [2019-10-15 01:05:06,368 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:05:06,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-10-15 01:05:06,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919987bab/aff99c76acc04cd39a7561c965ff75d5/FLAG3646034a5 [2019-10-15 01:05:06,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919987bab/aff99c76acc04cd39a7561c965ff75d5 [2019-10-15 01:05:06,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:05:06,701 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:05:06,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:06,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:05:06,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:05:06,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:06" (1/1) ... [2019-10-15 01:05:06,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d534ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:06, skipping insertion in model container [2019-10-15 01:05:06,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:06" (1/1) ... [2019-10-15 01:05:06,718 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:05:06,778 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:05:07,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:07,044 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:05:07,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:07,269 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:05:07,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:07 WrapperNode [2019-10-15 01:05:07,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:07,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:05:07,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:05:07,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:05:07,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:07" (1/1) ... [2019-10-15 01:05:07,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:07" (1/1) ... [2019-10-15 01:05:07,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:07" (1/1) ... [2019-10-15 01:05:07,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:07" (1/1) ... [2019-10-15 01:05:07,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:07" (1/1) ... [2019-10-15 01:05:07,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:07" (1/1) ... [2019-10-15 01:05:07,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:07" (1/1) ... [2019-10-15 01:05:07,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:05:07,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:05:07,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:05:07,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:05:07,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:07" (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 [2019-10-15 01:05:07,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:05:07,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:05:07,402 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:05:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:05:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:05:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:05:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:05:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:05:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:05:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:05:08,147 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:05:08,148 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:05:08,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:08 BoogieIcfgContainer [2019-10-15 01:05:08,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:05:08,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:05:08,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:05:08,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:05:08,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:05:06" (1/3) ... [2019-10-15 01:05:08,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e5c5b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:08, skipping insertion in model container [2019-10-15 01:05:08,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:07" (2/3) ... [2019-10-15 01:05:08,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e5c5b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:08, skipping insertion in model container [2019-10-15 01:05:08,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:08" (3/3) ... [2019-10-15 01:05:08,160 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-10-15 01:05:08,168 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:05:08,177 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-15 01:05:08,189 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-15 01:05:08,220 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:05:08,220 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:05:08,220 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:05:08,220 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:05:08,221 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:05:08,222 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:05:08,223 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:05:08,223 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:05:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-10-15 01:05:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 01:05:08,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:08,269 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:08,271 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:08,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:08,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2019-10-15 01:05:08,286 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:08,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054697141] [2019-10-15 01:05:08,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:08,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054697141] [2019-10-15 01:05:08,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:08,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:08,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514539399] [2019-10-15 01:05:08,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:08,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:08,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:08,513 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2019-10-15 01:05:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:08,915 INFO L93 Difference]: Finished difference Result 135 states and 211 transitions. [2019-10-15 01:05:08,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:05:08,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 01:05:08,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:08,931 INFO L225 Difference]: With dead ends: 135 [2019-10-15 01:05:08,932 INFO L226 Difference]: Without dead ends: 118 [2019-10-15 01:05:08,935 INFO L600 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 [2019-10-15 01:05:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-15 01:05:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-10-15 01:05:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-15 01:05:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2019-10-15 01:05:09,004 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2019-10-15 01:05:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:09,004 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2019-10-15 01:05:09,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2019-10-15 01:05:09,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 01:05:09,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:09,008 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:09,010 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:09,011 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2019-10-15 01:05:09,012 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:09,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58565879] [2019-10-15 01:05:09,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:09,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:09,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:09,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58565879] [2019-10-15 01:05:09,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:09,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:09,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458201638] [2019-10-15 01:05:09,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:09,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:09,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:09,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:09,115 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 4 states. [2019-10-15 01:05:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:09,297 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2019-10-15 01:05:09,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:05:09,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 01:05:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:09,299 INFO L225 Difference]: With dead ends: 118 [2019-10-15 01:05:09,299 INFO L226 Difference]: Without dead ends: 113 [2019-10-15 01:05:09,300 INFO L600 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 [2019-10-15 01:05:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-15 01:05:09,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-10-15 01:05:09,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-15 01:05:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2019-10-15 01:05:09,310 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2019-10-15 01:05:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:09,311 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2019-10-15 01:05:09,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2019-10-15 01:05:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 01:05:09,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:09,312 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:09,313 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:09,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:09,313 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2019-10-15 01:05:09,313 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:09,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700023452] [2019-10-15 01:05:09,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:09,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:09,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:09,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700023452] [2019-10-15 01:05:09,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:09,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:09,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700409154] [2019-10-15 01:05:09,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:09,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:09,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:09,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:09,373 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 5 states. [2019-10-15 01:05:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:09,609 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-10-15 01:05:09,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:09,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-15 01:05:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:09,612 INFO L225 Difference]: With dead ends: 113 [2019-10-15 01:05:09,612 INFO L226 Difference]: Without dead ends: 111 [2019-10-15 01:05:09,612 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-15 01:05:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-15 01:05:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-15 01:05:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2019-10-15 01:05:09,622 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2019-10-15 01:05:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:09,622 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2019-10-15 01:05:09,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2019-10-15 01:05:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:05:09,623 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:09,624 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:09,624 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:09,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:09,625 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2019-10-15 01:05:09,625 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:09,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856673589] [2019-10-15 01:05:09,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:09,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:09,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:09,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856673589] [2019-10-15 01:05:09,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:09,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:09,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630940119] [2019-10-15 01:05:09,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:09,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:09,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:09,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:09,683 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 4 states. [2019-10-15 01:05:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:09,843 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-15 01:05:09,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:05:09,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-15 01:05:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:09,846 INFO L225 Difference]: With dead ends: 111 [2019-10-15 01:05:09,847 INFO L226 Difference]: Without dead ends: 107 [2019-10-15 01:05:09,847 INFO L600 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 [2019-10-15 01:05:09,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-15 01:05:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-10-15 01:05:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-15 01:05:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-10-15 01:05:09,856 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2019-10-15 01:05:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:09,856 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-10-15 01:05:09,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-10-15 01:05:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:05:09,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:09,858 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:09,858 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:09,859 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2019-10-15 01:05:09,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:09,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998908728] [2019-10-15 01:05:09,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:09,860 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:09,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:09,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998908728] [2019-10-15 01:05:09,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:09,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:09,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003941558] [2019-10-15 01:05:09,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:09,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:09,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:09,937 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 5 states. [2019-10-15 01:05:10,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:10,178 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-10-15 01:05:10,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:10,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-15 01:05:10,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:10,180 INFO L225 Difference]: With dead ends: 125 [2019-10-15 01:05:10,180 INFO L226 Difference]: Without dead ends: 123 [2019-10-15 01:05:10,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-15 01:05:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2019-10-15 01:05:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-15 01:05:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2019-10-15 01:05:10,188 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2019-10-15 01:05:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:10,189 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2019-10-15 01:05:10,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2019-10-15 01:05:10,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:05:10,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:10,191 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:10,192 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:10,192 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2019-10-15 01:05:10,193 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:10,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145393253] [2019-10-15 01:05:10,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:10,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:10,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:10,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145393253] [2019-10-15 01:05:10,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:10,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:10,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676302155] [2019-10-15 01:05:10,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:10,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:10,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:10,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:10,247 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 5 states. [2019-10-15 01:05:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:10,467 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-10-15 01:05:10,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:10,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-15 01:05:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:10,469 INFO L225 Difference]: With dead ends: 105 [2019-10-15 01:05:10,469 INFO L226 Difference]: Without dead ends: 103 [2019-10-15 01:05:10,470 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-15 01:05:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-10-15 01:05:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-15 01:05:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-10-15 01:05:10,476 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2019-10-15 01:05:10,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:10,476 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-10-15 01:05:10,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-10-15 01:05:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:05:10,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:10,478 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:10,478 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:10,479 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2019-10-15 01:05:10,479 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:10,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804418654] [2019-10-15 01:05:10,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:10,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:10,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:10,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804418654] [2019-10-15 01:05:10,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:10,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:10,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356548810] [2019-10-15 01:05:10,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:10,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:10,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:10,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:10,575 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 5 states. [2019-10-15 01:05:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:10,829 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-10-15 01:05:10,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:10,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-15 01:05:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:10,831 INFO L225 Difference]: With dead ends: 120 [2019-10-15 01:05:10,831 INFO L226 Difference]: Without dead ends: 118 [2019-10-15 01:05:10,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-15 01:05:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2019-10-15 01:05:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-15 01:05:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-10-15 01:05:10,838 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2019-10-15 01:05:10,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:10,838 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-10-15 01:05:10,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:10,839 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-10-15 01:05:10,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:05:10,840 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:10,840 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:10,840 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:10,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:10,841 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2019-10-15 01:05:10,841 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:10,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650525406] [2019-10-15 01:05:10,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:10,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:10,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:10,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650525406] [2019-10-15 01:05:10,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:10,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:10,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641253322] [2019-10-15 01:05:10,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:10,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:10,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:10,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:10,887 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 5 states. [2019-10-15 01:05:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:11,067 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-10-15 01:05:11,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:11,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-15 01:05:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:11,069 INFO L225 Difference]: With dead ends: 120 [2019-10-15 01:05:11,069 INFO L226 Difference]: Without dead ends: 118 [2019-10-15 01:05:11,069 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:11,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-15 01:05:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2019-10-15 01:05:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-15 01:05:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-10-15 01:05:11,085 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2019-10-15 01:05:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:11,085 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-10-15 01:05:11,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-10-15 01:05:11,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:05:11,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:11,087 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:11,087 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:11,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:11,088 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2019-10-15 01:05:11,088 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:11,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427368999] [2019-10-15 01:05:11,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:11,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:11,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:11,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427368999] [2019-10-15 01:05:11,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:11,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:11,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726252924] [2019-10-15 01:05:11,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:11,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:11,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:11,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:11,143 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2019-10-15 01:05:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:11,340 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2019-10-15 01:05:11,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:11,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-15 01:05:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:11,342 INFO L225 Difference]: With dead ends: 99 [2019-10-15 01:05:11,343 INFO L226 Difference]: Without dead ends: 95 [2019-10-15 01:05:11,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-15 01:05:11,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-10-15 01:05:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-15 01:05:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-10-15 01:05:11,349 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 18 [2019-10-15 01:05:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:11,349 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-10-15 01:05:11,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-10-15 01:05:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:05:11,350 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:11,350 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:11,351 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:11,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:11,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2019-10-15 01:05:11,352 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:11,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475077220] [2019-10-15 01:05:11,352 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:11,352 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:11,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:11,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475077220] [2019-10-15 01:05:11,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:11,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:11,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912007168] [2019-10-15 01:05:11,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:11,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:11,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:11,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:11,430 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 5 states. [2019-10-15 01:05:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:11,686 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2019-10-15 01:05:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:11,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-15 01:05:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:11,687 INFO L225 Difference]: With dead ends: 111 [2019-10-15 01:05:11,687 INFO L226 Difference]: Without dead ends: 109 [2019-10-15 01:05:11,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-15 01:05:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2019-10-15 01:05:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-15 01:05:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2019-10-15 01:05:11,693 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 19 [2019-10-15 01:05:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:11,693 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2019-10-15 01:05:11,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2019-10-15 01:05:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:05:11,694 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:11,695 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:11,695 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:11,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:11,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2019-10-15 01:05:11,696 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:11,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427043729] [2019-10-15 01:05:11,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:11,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:11,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:11,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427043729] [2019-10-15 01:05:11,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:11,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:11,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195668846] [2019-10-15 01:05:11,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:11,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:11,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:11,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:11,741 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 6 states. [2019-10-15 01:05:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:11,961 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2019-10-15 01:05:11,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:11,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-15 01:05:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:11,963 INFO L225 Difference]: With dead ends: 103 [2019-10-15 01:05:11,963 INFO L226 Difference]: Without dead ends: 101 [2019-10-15 01:05:11,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-15 01:05:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2019-10-15 01:05:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-15 01:05:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-10-15 01:05:11,969 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 20 [2019-10-15 01:05:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:11,969 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-10-15 01:05:11,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-10-15 01:05:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:05:11,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:11,970 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:11,971 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:11,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:11,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2019-10-15 01:05:11,971 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:11,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271825031] [2019-10-15 01:05:11,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:11,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:11,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:12,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271825031] [2019-10-15 01:05:12,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:12,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:12,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471108735] [2019-10-15 01:05:12,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:12,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:12,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:12,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:12,054 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 4 states. [2019-10-15 01:05:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:12,179 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-10-15 01:05:12,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:05:12,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-15 01:05:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:12,180 INFO L225 Difference]: With dead ends: 91 [2019-10-15 01:05:12,181 INFO L226 Difference]: Without dead ends: 58 [2019-10-15 01:05:12,181 INFO L600 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 [2019-10-15 01:05:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-15 01:05:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-15 01:05:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-15 01:05:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-10-15 01:05:12,184 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 21 [2019-10-15 01:05:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:12,185 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-10-15 01:05:12,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-10-15 01:05:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 01:05:12,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:12,189 INFO L380 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] [2019-10-15 01:05:12,190 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:12,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:12,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1203360725, now seen corresponding path program 1 times [2019-10-15 01:05:12,190 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:12,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114736368] [2019-10-15 01:05:12,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:12,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:12,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:12,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114736368] [2019-10-15 01:05:12,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:12,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 01:05:12,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399123902] [2019-10-15 01:05:12,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:05:12,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:12,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:05:12,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:05:12,391 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 13 states. [2019-10-15 01:05:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:12,535 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-10-15 01:05:12,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:05:12,536 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-10-15 01:05:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:12,537 INFO L225 Difference]: With dead ends: 67 [2019-10-15 01:05:12,537 INFO L226 Difference]: Without dead ends: 65 [2019-10-15 01:05:12,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:05:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-15 01:05:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-10-15 01:05:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-15 01:05:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-10-15 01:05:12,541 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2019-10-15 01:05:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:12,541 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-10-15 01:05:12,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:05:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-10-15 01:05:12,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 01:05:12,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:12,542 INFO L380 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] [2019-10-15 01:05:12,543 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:12,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:12,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1203346823, now seen corresponding path program 1 times [2019-10-15 01:05:12,543 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:12,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015841161] [2019-10-15 01:05:12,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:12,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:12,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:12,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015841161] [2019-10-15 01:05:12,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:12,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 01:05:12,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961767171] [2019-10-15 01:05:12,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:05:12,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:05:12,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:05:12,702 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 13 states. [2019-10-15 01:05:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:12,817 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-10-15 01:05:12,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:05:12,817 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-10-15 01:05:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:12,818 INFO L225 Difference]: With dead ends: 56 [2019-10-15 01:05:12,818 INFO L226 Difference]: Without dead ends: 54 [2019-10-15 01:05:12,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:05:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-15 01:05:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-15 01:05:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-15 01:05:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-10-15 01:05:12,822 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2019-10-15 01:05:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:12,822 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-10-15 01:05:12,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:05:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-10-15 01:05:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:05:12,823 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:12,823 INFO L380 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] [2019-10-15 01:05:12,824 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:12,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:12,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1350519771, now seen corresponding path program 1 times [2019-10-15 01:05:12,825 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:12,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117105969] [2019-10-15 01:05:12,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:12,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:12,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:13,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117105969] [2019-10-15 01:05:13,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:13,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:13,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867747587] [2019-10-15 01:05:13,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:13,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:13,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:13,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:13,013 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 5 states. [2019-10-15 01:05:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:13,145 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-10-15 01:05:13,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:13,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-15 01:05:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:13,146 INFO L225 Difference]: With dead ends: 62 [2019-10-15 01:05:13,146 INFO L226 Difference]: Without dead ends: 60 [2019-10-15 01:05:13,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 26 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-15 01:05:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-10-15 01:05:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-15 01:05:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-10-15 01:05:13,150 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-10-15 01:05:13,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:13,150 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-10-15 01:05:13,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-10-15 01:05:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:05:13,151 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:13,152 INFO L380 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] [2019-10-15 01:05:13,152 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:13,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:13,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1350950747, now seen corresponding path program 1 times [2019-10-15 01:05:13,153 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:13,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319061759] [2019-10-15 01:05:13,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:13,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:13,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:13,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319061759] [2019-10-15 01:05:13,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:13,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:13,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285701407] [2019-10-15 01:05:13,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:13,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:13,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:13,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:13,348 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 5 states. [2019-10-15 01:05:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:13,435 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-10-15 01:05:13,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:13,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-15 01:05:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:13,436 INFO L225 Difference]: With dead ends: 52 [2019-10-15 01:05:13,436 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:05:13,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 26 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:05:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:05:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:05:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:05:13,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-10-15 01:05:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:13,437 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:05:13,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:05:13,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:05:13,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:05:13,546 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:05:13,546 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:05:13,546 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:05:13,546 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:05:13,547 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:05:13,547 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:05:13,547 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:05:13,547 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-10-15 01:05:13,547 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2019-10-15 01:05:13,547 INFO L443 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2019-10-15 01:05:13,548 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2019-10-15 01:05:13,548 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 12 1001) no Hoare annotation was computed. [2019-10-15 01:05:13,548 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2019-10-15 01:05:13,548 INFO L443 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2019-10-15 01:05:13,548 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2019-10-15 01:05:13,548 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-15 01:05:13,548 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2019-10-15 01:05:13,548 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-15 01:05:13,548 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2019-10-15 01:05:13,549 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2019-10-15 01:05:13,549 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2019-10-15 01:05:13,549 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-15 01:05:13,549 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-10-15 01:05:13,549 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2019-10-15 01:05:13,549 INFO L439 ceAbstractionStarter]: At program point L863(lines 21 995) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2019-10-15 01:05:13,549 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-10-15 01:05:13,550 INFO L443 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2019-10-15 01:05:13,550 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2019-10-15 01:05:13,550 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2019-10-15 01:05:13,550 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 12 1001) no Hoare annotation was computed. [2019-10-15 01:05:13,550 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2019-10-15 01:05:13,550 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-10-15 01:05:13,550 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2019-10-15 01:05:13,551 INFO L443 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2019-10-15 01:05:13,551 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2019-10-15 01:05:13,551 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2019-10-15 01:05:13,551 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2019-10-15 01:05:13,551 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2019-10-15 01:05:13,551 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2019-10-15 01:05:13,551 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2019-10-15 01:05:13,551 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2019-10-15 01:05:13,552 INFO L439 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2019-10-15 01:05:13,552 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-10-15 01:05:13,552 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2019-10-15 01:05:13,552 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2019-10-15 01:05:13,552 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-15 01:05:13,552 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2019-10-15 01:05:13,552 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2019-10-15 01:05:13,553 INFO L446 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2019-10-15 01:05:13,553 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2019-10-15 01:05:13,553 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2019-10-15 01:05:13,553 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2019-10-15 01:05:13,553 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2019-10-15 01:05:13,553 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-10-15 01:05:13,553 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2019-10-15 01:05:13,554 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2019-10-15 01:05:13,554 INFO L443 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2019-10-15 01:05:13,554 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-15 01:05:13,554 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2019-10-15 01:05:13,554 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2019-10-15 01:05:13,554 INFO L439 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2019-10-15 01:05:13,555 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2019-10-15 01:05:13,555 INFO L443 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2019-10-15 01:05:13,555 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2019-10-15 01:05:13,555 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2019-10-15 01:05:13,555 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2019-10-15 01:05:13,555 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-10-15 01:05:13,555 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2019-10-15 01:05:13,556 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2019-10-15 01:05:13,556 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2019-10-15 01:05:13,556 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-10-15 01:05:13,556 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2019-10-15 01:05:13,556 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2019-10-15 01:05:13,556 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2019-10-15 01:05:13,556 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2019-10-15 01:05:13,556 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-10-15 01:05:13,557 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2019-10-15 01:05:13,557 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2019-10-15 01:05:13,557 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-10-15 01:05:13,557 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2019-10-15 01:05:13,557 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2019-10-15 01:05:13,557 INFO L439 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2019-10-15 01:05:13,558 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-10-15 01:05:13,558 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-15 01:05:13,558 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2019-10-15 01:05:13,558 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-10-15 01:05:13,558 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 12 1001) the Hoare annotation is: true [2019-10-15 01:05:13,558 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2019-10-15 01:05:13,558 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2019-10-15 01:05:13,558 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2019-10-15 01:05:13,559 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2019-10-15 01:05:13,559 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2019-10-15 01:05:13,559 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2019-10-15 01:05:13,559 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-15 01:05:13,559 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-10-15 01:05:13,559 INFO L443 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-10-15 01:05:13,559 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2019-10-15 01:05:13,560 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-10-15 01:05:13,560 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2019-10-15 01:05:13,560 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2019-10-15 01:05:13,560 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-10-15 01:05:13,560 INFO L443 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2019-10-15 01:05:13,560 INFO L443 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2019-10-15 01:05:13,560 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-10-15 01:05:13,561 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2019-10-15 01:05:13,561 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2019-10-15 01:05:13,561 INFO L443 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-10-15 01:05:13,561 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2019-10-15 01:05:13,561 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2019-10-15 01:05:13,561 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-10-15 01:05:13,561 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2019-10-15 01:05:13,562 INFO L443 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2019-10-15 01:05:13,562 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2019-10-15 01:05:13,562 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2019-10-15 01:05:13,562 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-10-15 01:05:13,562 INFO L443 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2019-10-15 01:05:13,562 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-15 01:05:13,562 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2019-10-15 01:05:13,563 INFO L443 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2019-10-15 01:05:13,563 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-10-15 01:05:13,563 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2019-10-15 01:05:13,563 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2019-10-15 01:05:13,563 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2019-10-15 01:05:13,563 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2019-10-15 01:05:13,563 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2019-10-15 01:05:13,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:05:13 BoogieIcfgContainer [2019-10-15 01:05:13,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:05:13,590 INFO L168 Benchmark]: Toolchain (without parser) took 6887.24 ms. Allocated memory was 137.9 MB in the beginning and 282.1 MB in the end (delta: 144.2 MB). Free memory was 100.6 MB in the beginning and 179.2 MB in the end (delta: -78.5 MB). Peak memory consumption was 65.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:13,591 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-15 01:05:13,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.54 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.4 MB in the beginning and 177.7 MB in the end (delta: -77.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:13,593 INFO L168 Benchmark]: Boogie Preprocessor took 68.10 ms. Allocated memory is still 203.4 MB. Free memory was 177.7 MB in the beginning and 174.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:13,597 INFO L168 Benchmark]: RCFGBuilder took 810.84 ms. Allocated memory is still 203.4 MB. Free memory was 174.6 MB in the beginning and 126.5 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:13,604 INFO L168 Benchmark]: TraceAbstraction took 5436.37 ms. Allocated memory was 203.4 MB in the beginning and 282.1 MB in the end (delta: 78.6 MB). Free memory was 125.8 MB in the beginning and 179.2 MB in the end (delta: -53.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:13,612 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 567.54 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.4 MB in the beginning and 177.7 MB in the end (delta: -77.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.10 ms. Allocated memory is still 203.4 MB. Free memory was 177.7 MB in the beginning and 174.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.84 ms. Allocated memory is still 203.4 MB. Free memory was 174.6 MB in the beginning and 126.5 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5436.37 ms. Allocated memory was 203.4 MB in the beginning and 282.1 MB in the end (delta: 78.6 MB). Free memory was 125.8 MB in the beginning and 179.2 MB in the end (delta: -53.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: 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: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 43]: 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: 100]: 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: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: 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: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: 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: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 9 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 16 error locations. Result: SAFE, OverallTime: 5.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 766 SDtfs, 1939 SDslu, 883 SDs, 0 SdLazy, 2375 SolverSat, 454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 39 SyntacticMatches, 57 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 97 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 37 HoareAnnotationTreeSize, 9 FomulaSimplifications, 1141 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 103 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 44972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...