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/ssh-simplified/s3_srvr_8.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:08,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:08,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:08,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:08,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:08,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:08,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:08,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:08,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:08,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:08,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:08,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:08,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:08,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:08,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:08,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:08,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:08,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:08,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:08,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:08,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:08,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:08,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:08,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:08,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:08,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:08,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:08,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:08,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:08,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:08,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:08,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:08,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:08,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:08,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:08,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:08,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:08,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:08,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:08,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:08,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:08,658 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:28:08,679 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:08,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:08,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:08,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:08,681 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:08,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:08,681 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:08,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:08,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:08,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:08,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:08,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:08,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:08,683 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:08,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:08,683 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:08,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:08,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:08,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:08,684 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:08,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:08,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:08,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:08,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:08,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:08,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:08,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:08,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:08,686 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:28:08,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:08,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:08,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:08,986 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:08,987 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:08,987 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-10-15 01:28:09,060 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a21832b19/30a47c397bf24f1a98595e81269ecc47/FLAG5b56633ff [2019-10-15 01:28:09,612 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:09,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-10-15 01:28:09,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a21832b19/30a47c397bf24f1a98595e81269ecc47/FLAG5b56633ff [2019-10-15 01:28:09,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a21832b19/30a47c397bf24f1a98595e81269ecc47 [2019-10-15 01:28:09,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:09,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:09,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:09,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:09,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:09,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:09" (1/1) ... [2019-10-15 01:28:09,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@843e590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:09, skipping insertion in model container [2019-10-15 01:28:09,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:09" (1/1) ... [2019-10-15 01:28:09,956 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:10,006 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:10,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:10,251 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:10,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:10,419 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:10,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:10 WrapperNode [2019-10-15 01:28:10,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:10,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:10,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:10,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:10,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:10" (1/1) ... [2019-10-15 01:28:10,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:10" (1/1) ... [2019-10-15 01:28:10,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:10" (1/1) ... [2019-10-15 01:28:10,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:10" (1/1) ... [2019-10-15 01:28:10,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:10" (1/1) ... [2019-10-15 01:28:10,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:10" (1/1) ... [2019-10-15 01:28:10,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:10" (1/1) ... [2019-10-15 01:28:10,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:10,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:10,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:10,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:10,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:10" (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:28:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-15 01:28:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:28:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:28:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:28:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-15 01:28:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:10,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:10,794 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:28:11,341 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-15 01:28:11,342 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-15 01:28:11,344 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:11,345 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:28:11,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:11 BoogieIcfgContainer [2019-10-15 01:28:11,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:11,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:11,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:11,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:11,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:09" (1/3) ... [2019-10-15 01:28:11,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243f5029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:11, skipping insertion in model container [2019-10-15 01:28:11,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:10" (2/3) ... [2019-10-15 01:28:11,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243f5029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:11, skipping insertion in model container [2019-10-15 01:28:11,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:11" (3/3) ... [2019-10-15 01:28:11,356 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2019-10-15 01:28:11,367 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:11,376 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:11,388 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:11,417 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:11,418 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:11,418 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:11,418 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:11,419 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:11,419 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:11,419 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:11,419 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-10-15 01:28:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:28:11,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:11,452 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] [2019-10-15 01:28:11,454 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:11,459 INFO L82 PathProgramCache]: Analyzing trace with hash -617772913, now seen corresponding path program 1 times [2019-10-15 01:28:11,466 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:11,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52244592] [2019-10-15 01:28:11,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,785 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:28:11,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52244592] [2019-10-15 01:28:11,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:11,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:11,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606481421] [2019-10-15 01:28:11,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:11,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:11,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:11,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:11,814 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2019-10-15 01:28:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:12,257 INFO L93 Difference]: Finished difference Result 348 states and 596 transitions. [2019-10-15 01:28:12,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:12,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-15 01:28:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:12,273 INFO L225 Difference]: With dead ends: 348 [2019-10-15 01:28:12,274 INFO L226 Difference]: Without dead ends: 185 [2019-10-15 01:28:12,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:12,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-15 01:28:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2019-10-15 01:28:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-15 01:28:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 284 transitions. [2019-10-15 01:28:12,342 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 284 transitions. Word has length 47 [2019-10-15 01:28:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:12,342 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 284 transitions. [2019-10-15 01:28:12,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 284 transitions. [2019-10-15 01:28:12,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 01:28:12,345 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:12,346 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:28:12,346 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:12,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:12,347 INFO L82 PathProgramCache]: Analyzing trace with hash 401544370, now seen corresponding path program 1 times [2019-10-15 01:28:12,347 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:12,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351554550] [2019-10-15 01:28:12,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,348 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:12,500 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:28:12,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351554550] [2019-10-15 01:28:12,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:12,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:12,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696669442] [2019-10-15 01:28:12,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:12,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:12,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:12,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:12,506 INFO L87 Difference]: Start difference. First operand 177 states and 284 transitions. Second operand 5 states. [2019-10-15 01:28:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:12,823 INFO L93 Difference]: Finished difference Result 388 states and 636 transitions. [2019-10-15 01:28:12,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:12,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-15 01:28:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:12,828 INFO L225 Difference]: With dead ends: 388 [2019-10-15 01:28:12,829 INFO L226 Difference]: Without dead ends: 224 [2019-10-15 01:28:12,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-15 01:28:12,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2019-10-15 01:28:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-15 01:28:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-15 01:28:12,883 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 48 [2019-10-15 01:28:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:12,884 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-15 01:28:12,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-15 01:28:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-15 01:28:12,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:12,892 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:12,892 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:12,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:12,895 INFO L82 PathProgramCache]: Analyzing trace with hash 353705226, now seen corresponding path program 1 times [2019-10-15 01:28:12,896 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:12,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196000010] [2019-10-15 01:28:12,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:13,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196000010] [2019-10-15 01:28:13,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:13,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:13,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694150371] [2019-10-15 01:28:13,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:13,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:13,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:13,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:13,039 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-15 01:28:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:13,338 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-15 01:28:13,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:13,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-15 01:28:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:13,341 INFO L225 Difference]: With dead ends: 450 [2019-10-15 01:28:13,342 INFO L226 Difference]: Without dead ends: 247 [2019-10-15 01:28:13,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-15 01:28:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-15 01:28:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-15 01:28:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-15 01:28:13,358 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 75 [2019-10-15 01:28:13,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:13,358 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-15 01:28:13,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-15 01:28:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 01:28:13,362 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:13,365 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:13,366 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:13,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:13,366 INFO L82 PathProgramCache]: Analyzing trace with hash -668843297, now seen corresponding path program 1 times [2019-10-15 01:28:13,366 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:13,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115716264] [2019-10-15 01:28:13,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:13,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115716264] [2019-10-15 01:28:13,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:13,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:13,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996411674] [2019-10-15 01:28:13,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:13,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:13,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:13,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:13,484 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-15 01:28:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:13,752 INFO L93 Difference]: Finished difference Result 519 states and 878 transitions. [2019-10-15 01:28:13,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:13,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-10-15 01:28:13,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:13,756 INFO L225 Difference]: With dead ends: 519 [2019-10-15 01:28:13,757 INFO L226 Difference]: Without dead ends: 285 [2019-10-15 01:28:13,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-15 01:28:13,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-10-15 01:28:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-15 01:28:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 478 transitions. [2019-10-15 01:28:13,779 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 478 transitions. Word has length 80 [2019-10-15 01:28:13,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:13,782 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 478 transitions. [2019-10-15 01:28:13,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 478 transitions. [2019-10-15 01:28:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-15 01:28:13,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:13,788 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:13,788 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:13,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:13,788 INFO L82 PathProgramCache]: Analyzing trace with hash 293568124, now seen corresponding path program 1 times [2019-10-15 01:28:13,789 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:13,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929392499] [2019-10-15 01:28:13,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:13,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929392499] [2019-10-15 01:28:13,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:13,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:13,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829466429] [2019-10-15 01:28:13,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:13,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:13,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:13,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:13,895 INFO L87 Difference]: Start difference. First operand 283 states and 478 transitions. Second operand 5 states. [2019-10-15 01:28:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,147 INFO L93 Difference]: Finished difference Result 555 states and 941 transitions. [2019-10-15 01:28:14,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:14,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-10-15 01:28:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,153 INFO L225 Difference]: With dead ends: 555 [2019-10-15 01:28:14,153 INFO L226 Difference]: Without dead ends: 285 [2019-10-15 01:28:14,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-15 01:28:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-10-15 01:28:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-15 01:28:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 476 transitions. [2019-10-15 01:28:14,170 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 476 transitions. Word has length 81 [2019-10-15 01:28:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,170 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 476 transitions. [2019-10-15 01:28:14,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 476 transitions. [2019-10-15 01:28:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-15 01:28:14,172 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,173 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:14,173 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,173 INFO L82 PathProgramCache]: Analyzing trace with hash -95009440, now seen corresponding path program 1 times [2019-10-15 01:28:14,174 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623504799] [2019-10-15 01:28:14,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:14,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623504799] [2019-10-15 01:28:14,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:14,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:14,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343910996] [2019-10-15 01:28:14,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:14,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:14,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:14,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:14,264 INFO L87 Difference]: Start difference. First operand 283 states and 476 transitions. Second operand 5 states. [2019-10-15 01:28:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,452 INFO L93 Difference]: Finished difference Result 570 states and 963 transitions. [2019-10-15 01:28:14,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:14,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-10-15 01:28:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,455 INFO L225 Difference]: With dead ends: 570 [2019-10-15 01:28:14,455 INFO L226 Difference]: Without dead ends: 300 [2019-10-15 01:28:14,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-15 01:28:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-15 01:28:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-15 01:28:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-10-15 01:28:14,469 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 87 [2019-10-15 01:28:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,469 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-10-15 01:28:14,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-10-15 01:28:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-15 01:28:14,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,471 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:14,471 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1081604216, now seen corresponding path program 1 times [2019-10-15 01:28:14,472 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585449286] [2019-10-15 01:28:14,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:14,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585449286] [2019-10-15 01:28:14,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:14,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:14,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306608494] [2019-10-15 01:28:14,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:14,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:14,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:14,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:14,538 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 5 states. [2019-10-15 01:28:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,723 INFO L93 Difference]: Finished difference Result 585 states and 981 transitions. [2019-10-15 01:28:14,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:14,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-10-15 01:28:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,726 INFO L225 Difference]: With dead ends: 585 [2019-10-15 01:28:14,726 INFO L226 Difference]: Without dead ends: 300 [2019-10-15 01:28:14,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-15 01:28:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-15 01:28:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-15 01:28:14,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 494 transitions. [2019-10-15 01:28:14,752 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 494 transitions. Word has length 88 [2019-10-15 01:28:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,752 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 494 transitions. [2019-10-15 01:28:14,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 494 transitions. [2019-10-15 01:28:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 01:28:14,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,754 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:14,754 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2001210697, now seen corresponding path program 1 times [2019-10-15 01:28:14,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593814589] [2019-10-15 01:28:14,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-15 01:28:14,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593814589] [2019-10-15 01:28:14,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:14,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:14,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20804688] [2019-10-15 01:28:14,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:14,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:14,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:14,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:14,806 INFO L87 Difference]: Start difference. First operand 298 states and 494 transitions. Second operand 5 states. [2019-10-15 01:28:14,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,969 INFO L93 Difference]: Finished difference Result 592 states and 983 transitions. [2019-10-15 01:28:14,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:14,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-15 01:28:14,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,971 INFO L225 Difference]: With dead ends: 592 [2019-10-15 01:28:14,972 INFO L226 Difference]: Without dead ends: 307 [2019-10-15 01:28:14,973 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:14,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-15 01:28:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-10-15 01:28:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-15 01:28:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 500 transitions. [2019-10-15 01:28:14,984 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 500 transitions. Word has length 100 [2019-10-15 01:28:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,985 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 500 transitions. [2019-10-15 01:28:14,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 500 transitions. [2019-10-15 01:28:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:28:14,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,987 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:14,987 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1192129085, now seen corresponding path program 1 times [2019-10-15 01:28:14,987 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355041883] [2019-10-15 01:28:14,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:15,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355041883] [2019-10-15 01:28:15,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:15,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579826895] [2019-10-15 01:28:15,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:15,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:15,049 INFO L87 Difference]: Start difference. First operand 307 states and 500 transitions. Second operand 5 states. [2019-10-15 01:28:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:15,256 INFO L93 Difference]: Finished difference Result 632 states and 1036 transitions. [2019-10-15 01:28:15,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:15,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-10-15 01:28:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:15,259 INFO L225 Difference]: With dead ends: 632 [2019-10-15 01:28:15,259 INFO L226 Difference]: Without dead ends: 338 [2019-10-15 01:28:15,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-15 01:28:15,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-15 01:28:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-15 01:28:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-10-15 01:28:15,273 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 101 [2019-10-15 01:28:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:15,273 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-10-15 01:28:15,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-10-15 01:28:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:28:15,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:15,275 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:15,275 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,276 INFO L82 PathProgramCache]: Analyzing trace with hash 775386699, now seen corresponding path program 1 times [2019-10-15 01:28:15,276 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:15,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127858202] [2019-10-15 01:28:15,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:15,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127858202] [2019-10-15 01:28:15,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:15,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843154901] [2019-10-15 01:28:15,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:15,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:15,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:15,331 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 5 states. [2019-10-15 01:28:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:15,573 INFO L93 Difference]: Finished difference Result 661 states and 1079 transitions. [2019-10-15 01:28:15,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:15,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-15 01:28:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:15,576 INFO L225 Difference]: With dead ends: 661 [2019-10-15 01:28:15,576 INFO L226 Difference]: Without dead ends: 338 [2019-10-15 01:28:15,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-15 01:28:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-15 01:28:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-15 01:28:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 543 transitions. [2019-10-15 01:28:15,592 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 543 transitions. Word has length 102 [2019-10-15 01:28:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:15,593 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 543 transitions. [2019-10-15 01:28:15,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 543 transitions. [2019-10-15 01:28:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 01:28:15,595 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:15,596 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:15,596 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:15,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1217428909, now seen corresponding path program 1 times [2019-10-15 01:28:15,597 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:15,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284954761] [2019-10-15 01:28:15,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:15,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284954761] [2019-10-15 01:28:15,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:15,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010486434] [2019-10-15 01:28:15,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:15,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:15,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:15,662 INFO L87 Difference]: Start difference. First operand 336 states and 543 transitions. Second operand 5 states. [2019-10-15 01:28:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:15,878 INFO L93 Difference]: Finished difference Result 694 states and 1129 transitions. [2019-10-15 01:28:15,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:15,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-15 01:28:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:15,881 INFO L225 Difference]: With dead ends: 694 [2019-10-15 01:28:15,881 INFO L226 Difference]: Without dead ends: 371 [2019-10-15 01:28:15,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-15 01:28:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-15 01:28:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-15 01:28:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 585 transitions. [2019-10-15 01:28:15,898 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 585 transitions. Word has length 103 [2019-10-15 01:28:15,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:15,899 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 585 transitions. [2019-10-15 01:28:15,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 585 transitions. [2019-10-15 01:28:15,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:28:15,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:15,901 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:15,901 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:15,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,901 INFO L82 PathProgramCache]: Analyzing trace with hash -141729733, now seen corresponding path program 1 times [2019-10-15 01:28:15,902 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:15,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767998166] [2019-10-15 01:28:15,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:15,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767998166] [2019-10-15 01:28:15,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:15,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514949248] [2019-10-15 01:28:15,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:15,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:15,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:15,959 INFO L87 Difference]: Start difference. First operand 363 states and 585 transitions. Second operand 5 states. [2019-10-15 01:28:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:16,172 INFO L93 Difference]: Finished difference Result 721 states and 1166 transitions. [2019-10-15 01:28:16,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:16,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-15 01:28:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:16,175 INFO L225 Difference]: With dead ends: 721 [2019-10-15 01:28:16,175 INFO L226 Difference]: Without dead ends: 371 [2019-10-15 01:28:16,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-15 01:28:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-15 01:28:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-15 01:28:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 580 transitions. [2019-10-15 01:28:16,192 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 580 transitions. Word has length 104 [2019-10-15 01:28:16,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:16,193 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 580 transitions. [2019-10-15 01:28:16,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:16,193 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 580 transitions. [2019-10-15 01:28:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:28:16,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:16,195 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:16,195 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:16,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:16,196 INFO L82 PathProgramCache]: Analyzing trace with hash -564771468, now seen corresponding path program 1 times [2019-10-15 01:28:16,196 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:16,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773737512] [2019-10-15 01:28:16,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-15 01:28:16,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773737512] [2019-10-15 01:28:16,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:16,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:16,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66996716] [2019-10-15 01:28:16,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:16,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:16,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:16,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:16,272 INFO L87 Difference]: Start difference. First operand 363 states and 580 transitions. Second operand 5 states. [2019-10-15 01:28:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:16,493 INFO L93 Difference]: Finished difference Result 749 states and 1201 transitions. [2019-10-15 01:28:16,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:16,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-15 01:28:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:16,496 INFO L225 Difference]: With dead ends: 749 [2019-10-15 01:28:16,496 INFO L226 Difference]: Without dead ends: 399 [2019-10-15 01:28:16,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-15 01:28:16,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-10-15 01:28:16,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-15 01:28:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 633 transitions. [2019-10-15 01:28:16,513 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 633 transitions. Word has length 111 [2019-10-15 01:28:16,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:16,514 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 633 transitions. [2019-10-15 01:28:16,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 633 transitions. [2019-10-15 01:28:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:28:16,516 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:16,516 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:16,516 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:16,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash -285750569, now seen corresponding path program 1 times [2019-10-15 01:28:16,517 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:16,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547930909] [2019-10-15 01:28:16,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-15 01:28:16,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547930909] [2019-10-15 01:28:16,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:16,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:16,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853419519] [2019-10-15 01:28:16,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:16,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:16,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:16,567 INFO L87 Difference]: Start difference. First operand 397 states and 633 transitions. Second operand 5 states. [2019-10-15 01:28:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:16,775 INFO L93 Difference]: Finished difference Result 783 states and 1251 transitions. [2019-10-15 01:28:16,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:16,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-15 01:28:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:16,779 INFO L225 Difference]: With dead ends: 783 [2019-10-15 01:28:16,779 INFO L226 Difference]: Without dead ends: 399 [2019-10-15 01:28:16,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-15 01:28:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-10-15 01:28:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-15 01:28:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 630 transitions. [2019-10-15 01:28:16,801 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 630 transitions. Word has length 112 [2019-10-15 01:28:16,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:16,801 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 630 transitions. [2019-10-15 01:28:16,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 630 transitions. [2019-10-15 01:28:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:28:16,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:16,804 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:16,804 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:16,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:16,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1187170139, now seen corresponding path program 1 times [2019-10-15 01:28:16,805 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:16,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123674619] [2019-10-15 01:28:16,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:16,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123674619] [2019-10-15 01:28:16,866 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:16,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:16,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357190480] [2019-10-15 01:28:16,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:16,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:16,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:16,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:16,868 INFO L87 Difference]: Start difference. First operand 397 states and 630 transitions. Second operand 5 states. [2019-10-15 01:28:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:17,118 INFO L93 Difference]: Finished difference Result 828 states and 1317 transitions. [2019-10-15 01:28:17,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:17,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-10-15 01:28:17,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:17,122 INFO L225 Difference]: With dead ends: 828 [2019-10-15 01:28:17,122 INFO L226 Difference]: Without dead ends: 444 [2019-10-15 01:28:17,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-10-15 01:28:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 439. [2019-10-15 01:28:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-15 01:28:17,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 695 transitions. [2019-10-15 01:28:17,144 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 695 transitions. Word has length 117 [2019-10-15 01:28:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:17,144 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 695 transitions. [2019-10-15 01:28:17,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:17,144 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 695 transitions. [2019-10-15 01:28:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 01:28:17,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:17,146 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:17,147 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:17,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1861118978, now seen corresponding path program 1 times [2019-10-15 01:28:17,147 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:17,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673535061] [2019-10-15 01:28:17,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:17,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673535061] [2019-10-15 01:28:17,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:17,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:17,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994462881] [2019-10-15 01:28:17,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:17,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:17,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:17,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:17,202 INFO L87 Difference]: Start difference. First operand 439 states and 695 transitions. Second operand 5 states. [2019-10-15 01:28:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:17,421 INFO L93 Difference]: Finished difference Result 874 states and 1388 transitions. [2019-10-15 01:28:17,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:17,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-10-15 01:28:17,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:17,425 INFO L225 Difference]: With dead ends: 874 [2019-10-15 01:28:17,425 INFO L226 Difference]: Without dead ends: 446 [2019-10-15 01:28:17,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-15 01:28:17,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 441. [2019-10-15 01:28:17,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-15 01:28:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 698 transitions. [2019-10-15 01:28:17,445 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 698 transitions. Word has length 118 [2019-10-15 01:28:17,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:17,446 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 698 transitions. [2019-10-15 01:28:17,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 698 transitions. [2019-10-15 01:28:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-15 01:28:17,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:17,448 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:17,448 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash 385795336, now seen corresponding path program 1 times [2019-10-15 01:28:17,449 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:17,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280890634] [2019-10-15 01:28:17,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-15 01:28:17,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280890634] [2019-10-15 01:28:17,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:17,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:17,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591545602] [2019-10-15 01:28:17,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:17,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:17,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:17,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:17,511 INFO L87 Difference]: Start difference. First operand 441 states and 698 transitions. Second operand 5 states. [2019-10-15 01:28:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:17,703 INFO L93 Difference]: Finished difference Result 907 states and 1443 transitions. [2019-10-15 01:28:17,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:17,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-10-15 01:28:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:17,707 INFO L225 Difference]: With dead ends: 907 [2019-10-15 01:28:17,707 INFO L226 Difference]: Without dead ends: 479 [2019-10-15 01:28:17,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:17,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-15 01:28:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-10-15 01:28:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-15 01:28:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 733 transitions. [2019-10-15 01:28:17,737 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 733 transitions. Word has length 129 [2019-10-15 01:28:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:17,737 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 733 transitions. [2019-10-15 01:28:17,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 733 transitions. [2019-10-15 01:28:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:28:17,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:17,739 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:17,740 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:17,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:17,740 INFO L82 PathProgramCache]: Analyzing trace with hash -177817520, now seen corresponding path program 1 times [2019-10-15 01:28:17,740 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:17,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797016840] [2019-10-15 01:28:17,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-15 01:28:17,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797016840] [2019-10-15 01:28:17,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:17,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:17,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349365655] [2019-10-15 01:28:17,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:17,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:17,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:17,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:17,808 INFO L87 Difference]: Start difference. First operand 466 states and 733 transitions. Second operand 5 states. [2019-10-15 01:28:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:18,059 INFO L93 Difference]: Finished difference Result 932 states and 1470 transitions. [2019-10-15 01:28:18,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:18,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-15 01:28:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:18,064 INFO L225 Difference]: With dead ends: 932 [2019-10-15 01:28:18,064 INFO L226 Difference]: Without dead ends: 479 [2019-10-15 01:28:18,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-15 01:28:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-10-15 01:28:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-15 01:28:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 725 transitions. [2019-10-15 01:28:18,113 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 725 transitions. Word has length 130 [2019-10-15 01:28:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:18,114 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 725 transitions. [2019-10-15 01:28:18,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 725 transitions. [2019-10-15 01:28:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:28:18,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,118 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:18,119 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,119 INFO L82 PathProgramCache]: Analyzing trace with hash 755280415, now seen corresponding path program 1 times [2019-10-15 01:28:18,120 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404173331] [2019-10-15 01:28:18,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-15 01:28:18,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404173331] [2019-10-15 01:28:18,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:18,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:18,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186380569] [2019-10-15 01:28:18,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:18,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:18,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:18,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:18,205 INFO L87 Difference]: Start difference. First operand 466 states and 725 transitions. Second operand 5 states. [2019-10-15 01:28:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:18,499 INFO L93 Difference]: Finished difference Result 923 states and 1438 transitions. [2019-10-15 01:28:18,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:18,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-15 01:28:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:18,504 INFO L225 Difference]: With dead ends: 923 [2019-10-15 01:28:18,504 INFO L226 Difference]: Without dead ends: 470 [2019-10-15 01:28:18,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-15 01:28:18,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-10-15 01:28:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-15 01:28:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 720 transitions. [2019-10-15 01:28:18,542 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 720 transitions. Word has length 142 [2019-10-15 01:28:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:18,543 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 720 transitions. [2019-10-15 01:28:18,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 720 transitions. [2019-10-15 01:28:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:28:18,547 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,547 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:18,548 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,548 INFO L82 PathProgramCache]: Analyzing trace with hash -816490564, now seen corresponding path program 1 times [2019-10-15 01:28:18,548 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105677940] [2019-10-15 01:28:18,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-15 01:28:18,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105677940] [2019-10-15 01:28:18,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:18,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:18,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31046975] [2019-10-15 01:28:18,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:18,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:18,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:18,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:18,642 INFO L87 Difference]: Start difference. First operand 466 states and 720 transitions. Second operand 5 states. [2019-10-15 01:28:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:18,889 INFO L93 Difference]: Finished difference Result 923 states and 1428 transitions. [2019-10-15 01:28:18,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:18,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-15 01:28:18,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:18,892 INFO L225 Difference]: With dead ends: 923 [2019-10-15 01:28:18,892 INFO L226 Difference]: Without dead ends: 470 [2019-10-15 01:28:18,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-15 01:28:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-10-15 01:28:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-15 01:28:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 715 transitions. [2019-10-15 01:28:18,918 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 715 transitions. Word has length 143 [2019-10-15 01:28:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:18,919 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 715 transitions. [2019-10-15 01:28:18,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 715 transitions. [2019-10-15 01:28:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:28:18,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,925 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:18,925 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1136592958, now seen corresponding path program 1 times [2019-10-15 01:28:18,926 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572712472] [2019-10-15 01:28:18,926 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,926 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-15 01:28:19,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572712472] [2019-10-15 01:28:19,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:19,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:19,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660527383] [2019-10-15 01:28:19,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:19,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:19,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:19,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:19,012 INFO L87 Difference]: Start difference. First operand 466 states and 715 transitions. Second operand 5 states. [2019-10-15 01:28:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:19,241 INFO L93 Difference]: Finished difference Result 947 states and 1458 transitions. [2019-10-15 01:28:19,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:19,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:28:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:19,246 INFO L225 Difference]: With dead ends: 947 [2019-10-15 01:28:19,246 INFO L226 Difference]: Without dead ends: 494 [2019-10-15 01:28:19,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:19,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-15 01:28:19,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-10-15 01:28:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-15 01:28:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 746 transitions. [2019-10-15 01:28:19,283 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 746 transitions. Word has length 150 [2019-10-15 01:28:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:19,283 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 746 transitions. [2019-10-15 01:28:19,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 746 transitions. [2019-10-15 01:28:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:28:19,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:19,288 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:19,288 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:19,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:19,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1424495078, now seen corresponding path program 1 times [2019-10-15 01:28:19,289 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:19,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807632870] [2019-10-15 01:28:19,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-15 01:28:19,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807632870] [2019-10-15 01:28:19,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:19,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:19,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956857187] [2019-10-15 01:28:19,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:19,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:19,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:19,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:19,389 INFO L87 Difference]: Start difference. First operand 490 states and 746 transitions. Second operand 5 states. [2019-10-15 01:28:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:19,646 INFO L93 Difference]: Finished difference Result 971 states and 1480 transitions. [2019-10-15 01:28:19,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:19,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-15 01:28:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:19,652 INFO L225 Difference]: With dead ends: 971 [2019-10-15 01:28:19,652 INFO L226 Difference]: Without dead ends: 494 [2019-10-15 01:28:19,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-15 01:28:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-10-15 01:28:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-15 01:28:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 737 transitions. [2019-10-15 01:28:19,682 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 737 transitions. Word has length 151 [2019-10-15 01:28:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:19,683 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 737 transitions. [2019-10-15 01:28:19,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 737 transitions. [2019-10-15 01:28:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-15 01:28:19,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:19,686 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:19,686 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:19,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:19,687 INFO L82 PathProgramCache]: Analyzing trace with hash 311984194, now seen corresponding path program 1 times [2019-10-15 01:28:19,687 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:19,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405155118] [2019-10-15 01:28:19,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-15 01:28:19,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405155118] [2019-10-15 01:28:19,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:19,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:19,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532277732] [2019-10-15 01:28:19,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:19,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:19,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:19,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:19,813 INFO L87 Difference]: Start difference. First operand 490 states and 737 transitions. Second operand 5 states. [2019-10-15 01:28:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:20,041 INFO L93 Difference]: Finished difference Result 1014 states and 1523 transitions. [2019-10-15 01:28:20,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:20,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-15 01:28:20,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:20,044 INFO L225 Difference]: With dead ends: 1014 [2019-10-15 01:28:20,045 INFO L226 Difference]: Without dead ends: 537 [2019-10-15 01:28:20,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-15 01:28:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2019-10-15 01:28:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-10-15 01:28:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 792 transitions. [2019-10-15 01:28:20,074 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 792 transitions. Word has length 157 [2019-10-15 01:28:20,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:20,074 INFO L462 AbstractCegarLoop]: Abstraction has 531 states and 792 transitions. [2019-10-15 01:28:20,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 792 transitions. [2019-10-15 01:28:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:28:20,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:20,077 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:20,077 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:20,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:20,078 INFO L82 PathProgramCache]: Analyzing trace with hash -611548539, now seen corresponding path program 1 times [2019-10-15 01:28:20,078 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:20,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972026840] [2019-10-15 01:28:20,078 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,078 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-15 01:28:20,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972026840] [2019-10-15 01:28:20,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:20,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:20,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001308804] [2019-10-15 01:28:20,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:20,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:20,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:20,142 INFO L87 Difference]: Start difference. First operand 531 states and 792 transitions. Second operand 5 states. [2019-10-15 01:28:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:20,369 INFO L93 Difference]: Finished difference Result 1055 states and 1576 transitions. [2019-10-15 01:28:20,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:20,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-15 01:28:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:20,375 INFO L225 Difference]: With dead ends: 1055 [2019-10-15 01:28:20,375 INFO L226 Difference]: Without dead ends: 518 [2019-10-15 01:28:20,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-10-15 01:28:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-10-15 01:28:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-15 01:28:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 762 transitions. [2019-10-15 01:28:20,400 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 762 transitions. Word has length 158 [2019-10-15 01:28:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:20,400 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 762 transitions. [2019-10-15 01:28:20,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 762 transitions. [2019-10-15 01:28:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-15 01:28:20,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:20,403 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:20,403 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:20,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1831676618, now seen corresponding path program 1 times [2019-10-15 01:28:20,404 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:20,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035431819] [2019-10-15 01:28:20,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-15 01:28:20,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035431819] [2019-10-15 01:28:20,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:20,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:20,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475559893] [2019-10-15 01:28:20,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:20,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:20,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:20,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:20,464 INFO L87 Difference]: Start difference. First operand 512 states and 762 transitions. Second operand 5 states. [2019-10-15 01:28:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:20,700 INFO L93 Difference]: Finished difference Result 1036 states and 1548 transitions. [2019-10-15 01:28:20,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:20,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-10-15 01:28:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:20,705 INFO L225 Difference]: With dead ends: 1036 [2019-10-15 01:28:20,705 INFO L226 Difference]: Without dead ends: 537 [2019-10-15 01:28:20,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:20,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-15 01:28:20,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2019-10-15 01:28:20,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-15 01:28:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 786 transitions. [2019-10-15 01:28:20,743 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 786 transitions. Word has length 171 [2019-10-15 01:28:20,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:20,744 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 786 transitions. [2019-10-15 01:28:20,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 786 transitions. [2019-10-15 01:28:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-15 01:28:20,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:20,748 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:20,748 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:20,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:20,749 INFO L82 PathProgramCache]: Analyzing trace with hash -813103810, now seen corresponding path program 1 times [2019-10-15 01:28:20,749 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:20,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760737173] [2019-10-15 01:28:20,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-15 01:28:20,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760737173] [2019-10-15 01:28:20,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:20,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:20,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663756514] [2019-10-15 01:28:20,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:20,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:20,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:20,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:20,864 INFO L87 Difference]: Start difference. First operand 533 states and 786 transitions. Second operand 5 states. [2019-10-15 01:28:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:21,066 INFO L93 Difference]: Finished difference Result 1057 states and 1561 transitions. [2019-10-15 01:28:21,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:21,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-10-15 01:28:21,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:21,070 INFO L225 Difference]: With dead ends: 1057 [2019-10-15 01:28:21,070 INFO L226 Difference]: Without dead ends: 535 [2019-10-15 01:28:21,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:21,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-10-15 01:28:21,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2019-10-15 01:28:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-10-15 01:28:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 772 transitions. [2019-10-15 01:28:21,097 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 772 transitions. Word has length 172 [2019-10-15 01:28:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:21,097 INFO L462 AbstractCegarLoop]: Abstraction has 531 states and 772 transitions. [2019-10-15 01:28:21,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 772 transitions. [2019-10-15 01:28:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-15 01:28:21,100 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:21,101 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:21,101 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:21,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:21,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1628821973, now seen corresponding path program 1 times [2019-10-15 01:28:21,102 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:21,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582565890] [2019-10-15 01:28:21,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-15 01:28:21,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582565890] [2019-10-15 01:28:21,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676582120] [2019-10-15 01:28:21,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:21,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-15 01:28:21,376 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-15 01:28:21,452 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:21,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-15 01:28:21,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80517911] [2019-10-15 01:28:21,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:21,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:21,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:21,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:21,453 INFO L87 Difference]: Start difference. First operand 531 states and 772 transitions. Second operand 4 states. [2019-10-15 01:28:21,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:21,643 INFO L93 Difference]: Finished difference Result 2081 states and 3035 transitions. [2019-10-15 01:28:21,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:21,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-10-15 01:28:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:21,652 INFO L225 Difference]: With dead ends: 2081 [2019-10-15 01:28:21,652 INFO L226 Difference]: Without dead ends: 1563 [2019-10-15 01:28:21,655 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-10-15 01:28:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2019-10-15 01:28:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-10-15 01:28:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2271 transitions. [2019-10-15 01:28:21,748 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2271 transitions. Word has length 187 [2019-10-15 01:28:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:21,748 INFO L462 AbstractCegarLoop]: Abstraction has 1563 states and 2271 transitions. [2019-10-15 01:28:21,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2271 transitions. [2019-10-15 01:28:21,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-15 01:28:21,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:21,752 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:21,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:21,959 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:21,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:21,959 INFO L82 PathProgramCache]: Analyzing trace with hash -304112884, now seen corresponding path program 1 times [2019-10-15 01:28:21,960 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:21,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150282394] [2019-10-15 01:28:21,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-15 01:28:22,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150282394] [2019-10-15 01:28:22,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:22,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:22,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409940100] [2019-10-15 01:28:22,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:22,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:22,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:22,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:22,053 INFO L87 Difference]: Start difference. First operand 1563 states and 2271 transitions. Second operand 3 states. [2019-10-15 01:28:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,208 INFO L93 Difference]: Finished difference Result 3624 states and 5270 transitions. [2019-10-15 01:28:22,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:22,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-15 01:28:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,223 INFO L225 Difference]: With dead ends: 3624 [2019-10-15 01:28:22,223 INFO L226 Difference]: Without dead ends: 2074 [2019-10-15 01:28:22,228 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:22,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2019-10-15 01:28:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2019-10-15 01:28:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-10-15 01:28:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3008 transitions. [2019-10-15 01:28:22,384 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3008 transitions. Word has length 196 [2019-10-15 01:28:22,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:22,385 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 3008 transitions. [2019-10-15 01:28:22,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3008 transitions. [2019-10-15 01:28:22,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-15 01:28:22,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:22,394 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:22,394 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:22,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:22,395 INFO L82 PathProgramCache]: Analyzing trace with hash 779902296, now seen corresponding path program 1 times [2019-10-15 01:28:22,395 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:22,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690658993] [2019-10-15 01:28:22,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,685 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 468 proven. 26 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-15 01:28:22,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690658993] [2019-10-15 01:28:22,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116452949] [2019-10-15 01:28:22,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:22,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-10-15 01:28:23,005 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-10-15 01:28:23,123 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:23,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-15 01:28:23,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037197705] [2019-10-15 01:28:23,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:23,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:23,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:23,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:23,129 INFO L87 Difference]: Start difference. First operand 2074 states and 3008 transitions. Second operand 4 states. [2019-10-15 01:28:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:23,445 INFO L93 Difference]: Finished difference Result 5167 states and 7505 transitions. [2019-10-15 01:28:23,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:23,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-10-15 01:28:23,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:23,462 INFO L225 Difference]: With dead ends: 5167 [2019-10-15 01:28:23,463 INFO L226 Difference]: Without dead ends: 3106 [2019-10-15 01:28:23,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2019-10-15 01:28:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3106. [2019-10-15 01:28:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3106 states. [2019-10-15 01:28:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 4508 transitions. [2019-10-15 01:28:23,638 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 4508 transitions. Word has length 266 [2019-10-15 01:28:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:23,638 INFO L462 AbstractCegarLoop]: Abstraction has 3106 states and 4508 transitions. [2019-10-15 01:28:23,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 4508 transitions. [2019-10-15 01:28:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-10-15 01:28:23,647 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:23,648 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:23,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:23,861 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:23,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:23,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1979389122, now seen corresponding path program 1 times [2019-10-15 01:28:23,862 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:23,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65947136] [2019-10-15 01:28:23,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-10-15 01:28:24,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65947136] [2019-10-15 01:28:24,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:24,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:24,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147852768] [2019-10-15 01:28:24,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:24,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:24,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:24,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:24,009 INFO L87 Difference]: Start difference. First operand 3106 states and 4508 transitions. Second operand 3 states. [2019-10-15 01:28:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:24,475 INFO L93 Difference]: Finished difference Result 8796 states and 12757 transitions. [2019-10-15 01:28:24,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:24,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2019-10-15 01:28:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:24,511 INFO L225 Difference]: With dead ends: 8796 [2019-10-15 01:28:24,512 INFO L226 Difference]: Without dead ends: 5703 [2019-10-15 01:28:24,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2019-10-15 01:28:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5701. [2019-10-15 01:28:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5701 states. [2019-10-15 01:28:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 8249 transitions. [2019-10-15 01:28:24,942 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 8249 transitions. Word has length 346 [2019-10-15 01:28:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:24,942 INFO L462 AbstractCegarLoop]: Abstraction has 5701 states and 8249 transitions. [2019-10-15 01:28:24,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 8249 transitions. [2019-10-15 01:28:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-10-15 01:28:24,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:24,956 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:24,956 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:24,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1101052781, now seen corresponding path program 1 times [2019-10-15 01:28:24,957 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:24,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560799625] [2019-10-15 01:28:24,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-10-15 01:28:25,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560799625] [2019-10-15 01:28:25,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:25,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:25,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37013314] [2019-10-15 01:28:25,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:25,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:25,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:25,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:25,167 INFO L87 Difference]: Start difference. First operand 5701 states and 8249 transitions. Second operand 3 states. [2019-10-15 01:28:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:25,640 INFO L93 Difference]: Finished difference Result 11629 states and 16865 transitions. [2019-10-15 01:28:25,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:25,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2019-10-15 01:28:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:25,664 INFO L225 Difference]: With dead ends: 11629 [2019-10-15 01:28:25,664 INFO L226 Difference]: Without dead ends: 4505 [2019-10-15 01:28:25,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2019-10-15 01:28:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 4465. [2019-10-15 01:28:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4465 states. [2019-10-15 01:28:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 6358 transitions. [2019-10-15 01:28:25,887 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 6358 transitions. Word has length 383 [2019-10-15 01:28:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:25,887 INFO L462 AbstractCegarLoop]: Abstraction has 4465 states and 6358 transitions. [2019-10-15 01:28:25,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 6358 transitions. [2019-10-15 01:28:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-10-15 01:28:25,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:25,899 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:25,899 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:25,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:25,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1869824397, now seen corresponding path program 1 times [2019-10-15 01:28:25,900 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:25,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923664515] [2019-10-15 01:28:25,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-15 01:28:26,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923664515] [2019-10-15 01:28:26,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325836013] [2019-10-15 01:28:26,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:26,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:26,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-10-15 01:28:26,568 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-10-15 01:28:26,961 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:26,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:26,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703000119] [2019-10-15 01:28:26,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:26,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:26,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:26,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:26,966 INFO L87 Difference]: Start difference. First operand 4465 states and 6358 transitions. Second operand 3 states. [2019-10-15 01:28:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:27,163 INFO L93 Difference]: Finished difference Result 4525 states and 6444 transitions. [2019-10-15 01:28:27,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:27,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 449 [2019-10-15 01:28:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:27,192 INFO L225 Difference]: With dead ends: 4525 [2019-10-15 01:28:27,193 INFO L226 Difference]: Without dead ends: 3146 [2019-10-15 01:28:27,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2019-10-15 01:28:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 3088. [2019-10-15 01:28:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3088 states. [2019-10-15 01:28:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 4395 transitions. [2019-10-15 01:28:27,429 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 4395 transitions. Word has length 449 [2019-10-15 01:28:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:27,431 INFO L462 AbstractCegarLoop]: Abstraction has 3088 states and 4395 transitions. [2019-10-15 01:28:27,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:27,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 4395 transitions. [2019-10-15 01:28:27,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-10-15 01:28:27,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:27,445 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:27,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:27,653 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:27,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:27,654 INFO L82 PathProgramCache]: Analyzing trace with hash -915884239, now seen corresponding path program 1 times [2019-10-15 01:28:27,654 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:27,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268985289] [2019-10-15 01:28:27,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:27,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:27,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-15 01:28:28,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268985289] [2019-10-15 01:28:28,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580342186] [2019-10-15 01:28:28,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:28,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:28,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-10-15 01:28:28,445 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-10-15 01:28:28,732 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:28,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:28,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904416998] [2019-10-15 01:28:28,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:28,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:28,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:28,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:28,735 INFO L87 Difference]: Start difference. First operand 3088 states and 4395 transitions. Second operand 3 states. [2019-10-15 01:28:28,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:28,930 INFO L93 Difference]: Finished difference Result 6631 states and 9448 transitions. [2019-10-15 01:28:28,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:28,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 449 [2019-10-15 01:28:28,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:28,941 INFO L225 Difference]: With dead ends: 6631 [2019-10-15 01:28:28,942 INFO L226 Difference]: Without dead ends: 3556 [2019-10-15 01:28:28,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3556 states. [2019-10-15 01:28:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3556 to 3556. [2019-10-15 01:28:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3556 states. [2019-10-15 01:28:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 5062 transitions. [2019-10-15 01:28:29,105 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 5062 transitions. Word has length 449 [2019-10-15 01:28:29,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:29,106 INFO L462 AbstractCegarLoop]: Abstraction has 3556 states and 5062 transitions. [2019-10-15 01:28:29,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 5062 transitions. [2019-10-15 01:28:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-10-15 01:28:29,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:29,116 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:29,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:29,329 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:29,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:29,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1287293752, now seen corresponding path program 1 times [2019-10-15 01:28:29,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:29,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780400535] [2019-10-15 01:28:29,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:29,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:29,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 1629 proven. 26 refuted. 0 times theorem prover too weak. 1531 trivial. 0 not checked. [2019-10-15 01:28:29,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780400535] [2019-10-15 01:28:29,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409374001] [2019-10-15 01:28:29,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:30,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:30,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 1679 proven. 0 refuted. 0 times theorem prover too weak. 1507 trivial. 0 not checked. [2019-10-15 01:28:30,352 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 1679 proven. 0 refuted. 0 times theorem prover too weak. 1507 trivial. 0 not checked. [2019-10-15 01:28:30,723 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:30,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:30,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376628438] [2019-10-15 01:28:30,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:30,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:30,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:30,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:30,725 INFO L87 Difference]: Start difference. First operand 3556 states and 5062 transitions. Second operand 3 states. [2019-10-15 01:28:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:30,944 INFO L93 Difference]: Finished difference Result 7612 states and 10840 transitions. [2019-10-15 01:28:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:30,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 561 [2019-10-15 01:28:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:30,956 INFO L225 Difference]: With dead ends: 7612 [2019-10-15 01:28:30,957 INFO L226 Difference]: Without dead ends: 4069 [2019-10-15 01:28:30,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1125 GetRequests, 1121 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states. [2019-10-15 01:28:31,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 4069. [2019-10-15 01:28:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2019-10-15 01:28:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 5794 transitions. [2019-10-15 01:28:31,160 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 5794 transitions. Word has length 561 [2019-10-15 01:28:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:31,161 INFO L462 AbstractCegarLoop]: Abstraction has 4069 states and 5794 transitions. [2019-10-15 01:28:31,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 5794 transitions. [2019-10-15 01:28:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-10-15 01:28:31,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:31,174 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:31,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:31,388 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:31,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:31,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1109132628, now seen corresponding path program 1 times [2019-10-15 01:28:31,389 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:31,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081770734] [2019-10-15 01:28:31,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:31,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:31,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-15 01:28:31,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081770734] [2019-10-15 01:28:31,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106615437] [2019-10-15 01:28:31,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:32,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:32,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-15 01:28:32,285 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-15 01:28:32,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1991380301] [2019-10-15 01:28:32,478 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 601 [2019-10-15 01:28:32,521 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:32,522 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:32,794 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:34,244 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:34,247 INFO L272 AbstractInterpreter]: Visited 109 different actions 2392 times. Merged at 95 different actions 1937 times. Widened at 18 different actions 293 times. Performed 5536 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5536 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 319 fixpoints after 32 different actions. Largest state had 97 variables. [2019-10-15 01:28:34,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:34,253 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:34,254 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:34,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:34,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269389775] [2019-10-15 01:28:34,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:34,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:34,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:34,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:34,256 INFO L87 Difference]: Start difference. First operand 4069 states and 5794 transitions. Second operand 6 states. [2019-10-15 01:28:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:34,762 INFO L93 Difference]: Finished difference Result 8211 states and 11666 transitions. [2019-10-15 01:28:34,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:34,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 600 [2019-10-15 01:28:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:34,772 INFO L225 Difference]: With dead ends: 8211 [2019-10-15 01:28:34,772 INFO L226 Difference]: Without dead ends: 4067 [2019-10-15 01:28:34,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1207 GetRequests, 1201 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:34,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2019-10-15 01:28:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3780. [2019-10-15 01:28:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2019-10-15 01:28:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5132 transitions. [2019-10-15 01:28:34,946 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5132 transitions. Word has length 600 [2019-10-15 01:28:34,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:34,946 INFO L462 AbstractCegarLoop]: Abstraction has 3780 states and 5132 transitions. [2019-10-15 01:28:34,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5132 transitions. [2019-10-15 01:28:34,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1021 [2019-10-15 01:28:34,964 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:34,965 INFO L380 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:35,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:35,171 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:35,171 INFO L82 PathProgramCache]: Analyzing trace with hash 859855159, now seen corresponding path program 1 times [2019-10-15 01:28:35,172 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:35,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965599295] [2019-10-15 01:28:35,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:35,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:35,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-15 01:28:36,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965599295] [2019-10-15 01:28:36,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710578155] [2019-10-15 01:28:36,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:36,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:36,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-15 01:28:36,834 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-15 01:28:37,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1868849359] [2019-10-15 01:28:37,390 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 1021 [2019-10-15 01:28:37,395 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:37,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:37,447 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:38,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:38,925 INFO L272 AbstractInterpreter]: Visited 121 different actions 2696 times. Merged at 104 different actions 2127 times. Widened at 22 different actions 342 times. Performed 6485 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6485 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 401 fixpoints after 28 different actions. Largest state had 101 variables. [2019-10-15 01:28:38,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:38,926 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:38,926 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:38,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:38,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047090354] [2019-10-15 01:28:38,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:38,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:38,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:38,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:38,930 INFO L87 Difference]: Start difference. First operand 3780 states and 5132 transitions. Second operand 6 states. [2019-10-15 01:28:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:39,738 INFO L93 Difference]: Finished difference Result 11228 states and 15494 transitions. [2019-10-15 01:28:39,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:39,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1020 [2019-10-15 01:28:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:39,752 INFO L225 Difference]: With dead ends: 11228 [2019-10-15 01:28:39,752 INFO L226 Difference]: Without dead ends: 7183 [2019-10-15 01:28:39,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2049 GetRequests, 2042 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7183 states. [2019-10-15 01:28:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7183 to 4292. [2019-10-15 01:28:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4292 states. [2019-10-15 01:28:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 5908 transitions. [2019-10-15 01:28:39,977 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 5908 transitions. Word has length 1020 [2019-10-15 01:28:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:39,982 INFO L462 AbstractCegarLoop]: Abstraction has 4292 states and 5908 transitions. [2019-10-15 01:28:39,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 5908 transitions.