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_6.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:05,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:05,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:05,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:05,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:05,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:05,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:05,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:05,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:05,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:05,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:05,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:05,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:05,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:05,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:05,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:05,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:05,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:05,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:05,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:05,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:05,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:05,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:05,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:05,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:05,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:05,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:05,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:05,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:05,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:05,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:05,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:05,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:05,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:05,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:05,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:05,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:05,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:05,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:05,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:05,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:05,851 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:05,879 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:05,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:05,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:05,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:05,882 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:05,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:05,883 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:05,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:05,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:05,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:05,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:05,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:05,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:05,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:05,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:05,885 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:05,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:05,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:05,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:05,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:05,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:05,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:05,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:05,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:05,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:05,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:05,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:05,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:05,888 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:06,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:06,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:06,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:06,199 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:06,200 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:06,201 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_6.cil-2.c [2019-10-15 01:28:06,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3bb513f4/58d4c275f7b3468bbda281f62cd11987/FLAGd72323d70 [2019-10-15 01:28:06,754 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:06,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_6.cil-2.c [2019-10-15 01:28:06,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3bb513f4/58d4c275f7b3468bbda281f62cd11987/FLAGd72323d70 [2019-10-15 01:28:07,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3bb513f4/58d4c275f7b3468bbda281f62cd11987 [2019-10-15 01:28:07,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:07,122 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:07,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:07,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:07,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:07,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:07" (1/1) ... [2019-10-15 01:28:07,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6063a733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:07, skipping insertion in model container [2019-10-15 01:28:07,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:07" (1/1) ... [2019-10-15 01:28:07,140 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:07,205 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:07,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:07,534 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:07,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:07,708 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:07,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:07 WrapperNode [2019-10-15 01:28:07,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:07,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:07,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:07,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:07,722 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:07" (1/1) ... [2019-10-15 01:28:07,722 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:07" (1/1) ... [2019-10-15 01:28:07,737 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:07" (1/1) ... [2019-10-15 01:28:07,737 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:07" (1/1) ... [2019-10-15 01:28:07,759 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:07" (1/1) ... [2019-10-15 01:28:07,780 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:07" (1/1) ... [2019-10-15 01:28:07,784 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:07" (1/1) ... [2019-10-15 01:28:07,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:07,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:07,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:07,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:07,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:07,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:07,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:07,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-15 01:28:07,852 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:28:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:28:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:28:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-15 01:28:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:08,045 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:28:08,717 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-15 01:28:08,718 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-15 01:28:08,721 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:08,721 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:28:08,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:08 BoogieIcfgContainer [2019-10-15 01:28:08,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:08,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:08,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:08,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:08,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:07" (1/3) ... [2019-10-15 01:28:08,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dfa618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:08, skipping insertion in model container [2019-10-15 01:28:08,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:07" (2/3) ... [2019-10-15 01:28:08,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dfa618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:08, skipping insertion in model container [2019-10-15 01:28:08,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:08" (3/3) ... [2019-10-15 01:28:08,731 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_6.cil-2.c [2019-10-15 01:28:08,741 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:08,750 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:08,761 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:08,788 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:08,789 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:08,789 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:08,789 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:08,789 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:08,789 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:08,790 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:08,790 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-10-15 01:28:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:28:08,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:08,834 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:08,836 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:08,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:08,841 INFO L82 PathProgramCache]: Analyzing trace with hash 887093352, now seen corresponding path program 1 times [2019-10-15 01:28:08,848 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:08,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001552089] [2019-10-15 01:28:08,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:09,148 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:09,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001552089] [2019-10-15 01:28:09,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:09,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:09,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172359591] [2019-10-15 01:28:09,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:09,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:09,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:09,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:09,178 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 5 states. [2019-10-15 01:28:09,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:09,711 INFO L93 Difference]: Finished difference Result 372 states and 644 transitions. [2019-10-15 01:28:09,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:09,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-15 01:28:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:09,741 INFO L225 Difference]: With dead ends: 372 [2019-10-15 01:28:09,742 INFO L226 Difference]: Without dead ends: 198 [2019-10-15 01:28:09,750 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:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-15 01:28:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2019-10-15 01:28:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-15 01:28:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 306 transitions. [2019-10-15 01:28:09,862 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 306 transitions. Word has length 49 [2019-10-15 01:28:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:09,864 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 306 transitions. [2019-10-15 01:28:09,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 306 transitions. [2019-10-15 01:28:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:28:09,871 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:09,871 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:09,871 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:09,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:09,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1023309003, now seen corresponding path program 1 times [2019-10-15 01:28:09,873 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:09,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107195367] [2019-10-15 01:28:09,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,024 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:10,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107195367] [2019-10-15 01:28:10,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:10,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357617623] [2019-10-15 01:28:10,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:10,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:10,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:10,031 INFO L87 Difference]: Start difference. First operand 188 states and 306 transitions. Second operand 5 states. [2019-10-15 01:28:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:10,365 INFO L93 Difference]: Finished difference Result 412 states and 684 transitions. [2019-10-15 01:28:10,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:10,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-15 01:28:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:10,368 INFO L225 Difference]: With dead ends: 412 [2019-10-15 01:28:10,369 INFO L226 Difference]: Without dead ends: 237 [2019-10-15 01:28:10,371 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:10,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-15 01:28:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 227. [2019-10-15 01:28:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-15 01:28:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 379 transitions. [2019-10-15 01:28:10,387 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 379 transitions. Word has length 50 [2019-10-15 01:28:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:10,387 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 379 transitions. [2019-10-15 01:28:10,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 379 transitions. [2019-10-15 01:28:10,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:10,391 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:10,391 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, 1, 1] [2019-10-15 01:28:10,392 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:10,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:10,392 INFO L82 PathProgramCache]: Analyzing trace with hash -141028317, now seen corresponding path program 1 times [2019-10-15 01:28:10,392 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:10,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968778872] [2019-10-15 01:28:10,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,513 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:10,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968778872] [2019-10-15 01:28:10,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:10,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866211528] [2019-10-15 01:28:10,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:10,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:10,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:10,521 INFO L87 Difference]: Start difference. First operand 227 states and 379 transitions. Second operand 5 states. [2019-10-15 01:28:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:10,774 INFO L93 Difference]: Finished difference Result 472 states and 799 transitions. [2019-10-15 01:28:10,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:10,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-15 01:28:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:10,777 INFO L225 Difference]: With dead ends: 472 [2019-10-15 01:28:10,778 INFO L226 Difference]: Without dead ends: 258 [2019-10-15 01:28:10,779 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:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-15 01:28:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-10-15 01:28:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-15 01:28:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 435 transitions. [2019-10-15 01:28:10,793 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 435 transitions. Word has length 77 [2019-10-15 01:28:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:10,794 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 435 transitions. [2019-10-15 01:28:10,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2019-10-15 01:28:10,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-15 01:28:10,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:10,797 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, 1, 1, 1] [2019-10-15 01:28:10,797 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:10,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1615796808, now seen corresponding path program 1 times [2019-10-15 01:28:10,798 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:10,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700163535] [2019-10-15 01:28:10,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,928 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:10,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700163535] [2019-10-15 01:28:10,929 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:10,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600253454] [2019-10-15 01:28:10,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:10,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:10,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:10,932 INFO L87 Difference]: Start difference. First operand 258 states and 435 transitions. Second operand 5 states. [2019-10-15 01:28:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:11,173 INFO L93 Difference]: Finished difference Result 542 states and 924 transitions. [2019-10-15 01:28:11,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:11,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-10-15 01:28:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:11,177 INFO L225 Difference]: With dead ends: 542 [2019-10-15 01:28:11,177 INFO L226 Difference]: Without dead ends: 297 [2019-10-15 01:28:11,178 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:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-15 01:28:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2019-10-15 01:28:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-15 01:28:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-10-15 01:28:11,192 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-10-15 01:28:11,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:11,192 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-10-15 01:28:11,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-10-15 01:28:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-15 01:28:11,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:11,194 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, 1, 1, 1] [2019-10-15 01:28:11,195 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:11,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:11,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1136743931, now seen corresponding path program 1 times [2019-10-15 01:28:11,196 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:11,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276015803] [2019-10-15 01:28:11,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,294 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:11,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276015803] [2019-10-15 01:28:11,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:11,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:11,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008091822] [2019-10-15 01:28:11,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:11,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:11,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:11,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:11,297 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 5 states. [2019-10-15 01:28:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:11,530 INFO L93 Difference]: Finished difference Result 578 states and 987 transitions. [2019-10-15 01:28:11,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:11,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-10-15 01:28:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:11,533 INFO L225 Difference]: With dead ends: 578 [2019-10-15 01:28:11,533 INFO L226 Difference]: Without dead ends: 297 [2019-10-15 01:28:11,534 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:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-15 01:28:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2019-10-15 01:28:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-15 01:28:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 498 transitions. [2019-10-15 01:28:11,545 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 498 transitions. Word has length 84 [2019-10-15 01:28:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:11,546 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 498 transitions. [2019-10-15 01:28:11,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 498 transitions. [2019-10-15 01:28:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 01:28:11,547 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:11,547 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, 1, 1] [2019-10-15 01:28:11,548 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:11,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2104928583, now seen corresponding path program 1 times [2019-10-15 01:28:11,548 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:11,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618981719] [2019-10-15 01:28:11,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,651 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:11,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618981719] [2019-10-15 01:28:11,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:11,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:11,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117812942] [2019-10-15 01:28:11,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:11,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:11,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:11,654 INFO L87 Difference]: Start difference. First operand 294 states and 498 transitions. Second operand 5 states. [2019-10-15 01:28:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:11,852 INFO L93 Difference]: Finished difference Result 592 states and 1007 transitions. [2019-10-15 01:28:11,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:11,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-15 01:28:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:11,861 INFO L225 Difference]: With dead ends: 592 [2019-10-15 01:28:11,861 INFO L226 Difference]: Without dead ends: 311 [2019-10-15 01:28:11,862 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:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-15 01:28:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2019-10-15 01:28:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-15 01:28:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 520 transitions. [2019-10-15 01:28:11,876 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 520 transitions. Word has length 89 [2019-10-15 01:28:11,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:11,876 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 520 transitions. [2019-10-15 01:28:11,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 520 transitions. [2019-10-15 01:28:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 01:28:11,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:11,878 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, 1, 1] [2019-10-15 01:28:11,878 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:11,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:11,879 INFO L82 PathProgramCache]: Analyzing trace with hash -281961503, now seen corresponding path program 1 times [2019-10-15 01:28:11,879 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:11,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999724954] [2019-10-15 01:28:11,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,936 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:11,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999724954] [2019-10-15 01:28:11,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:11,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:11,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814844423] [2019-10-15 01:28:11,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:11,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:11,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:11,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:11,939 INFO L87 Difference]: Start difference. First operand 309 states and 520 transitions. Second operand 5 states. [2019-10-15 01:28:12,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:12,155 INFO L93 Difference]: Finished difference Result 607 states and 1025 transitions. [2019-10-15 01:28:12,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:12,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-15 01:28:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:12,174 INFO L225 Difference]: With dead ends: 607 [2019-10-15 01:28:12,175 INFO L226 Difference]: Without dead ends: 311 [2019-10-15 01:28:12,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:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-15 01:28:12,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2019-10-15 01:28:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-15 01:28:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 516 transitions. [2019-10-15 01:28:12,189 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 516 transitions. Word has length 90 [2019-10-15 01:28:12,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:12,189 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 516 transitions. [2019-10-15 01:28:12,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:12,190 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 516 transitions. [2019-10-15 01:28:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:28:12,191 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:12,191 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, 1, 1] [2019-10-15 01:28:12,191 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:12,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:12,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1109463774, now seen corresponding path program 1 times [2019-10-15 01:28:12,192 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:12,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221801205] [2019-10-15 01:28:12,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:12,262 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:12,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221801205] [2019-10-15 01:28:12,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:12,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:12,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868760207] [2019-10-15 01:28:12,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:12,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:12,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:12,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:12,265 INFO L87 Difference]: Start difference. First operand 309 states and 516 transitions. Second operand 5 states. [2019-10-15 01:28:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:12,470 INFO L93 Difference]: Finished difference Result 614 states and 1027 transitions. [2019-10-15 01:28:12,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:12,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-15 01:28:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:12,474 INFO L225 Difference]: With dead ends: 614 [2019-10-15 01:28:12,474 INFO L226 Difference]: Without dead ends: 318 [2019-10-15 01:28:12,476 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,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-15 01:28:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-10-15 01:28:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-10-15 01:28:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 522 transitions. [2019-10-15 01:28:12,494 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 522 transitions. Word has length 102 [2019-10-15 01:28:12,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:12,495 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 522 transitions. [2019-10-15 01:28:12,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 522 transitions. [2019-10-15 01:28:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 01:28:12,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:12,497 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, 1, 1] [2019-10-15 01:28:12,497 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:12,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1351505052, now seen corresponding path program 1 times [2019-10-15 01:28:12,498 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:12,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748127040] [2019-10-15 01:28:12,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:12,588 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:12,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748127040] [2019-10-15 01:28:12,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:12,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:12,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737814541] [2019-10-15 01:28:12,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:12,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:12,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:12,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:12,592 INFO L87 Difference]: Start difference. First operand 318 states and 522 transitions. Second operand 5 states. [2019-10-15 01:28:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:12,802 INFO L93 Difference]: Finished difference Result 654 states and 1080 transitions. [2019-10-15 01:28:12,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:12,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-15 01:28:12,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:12,805 INFO L225 Difference]: With dead ends: 654 [2019-10-15 01:28:12,805 INFO L226 Difference]: Without dead ends: 349 [2019-10-15 01:28:12,807 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,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-15 01:28:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2019-10-15 01:28:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-15 01:28:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 569 transitions. [2019-10-15 01:28:12,823 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 569 transitions. Word has length 103 [2019-10-15 01:28:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:12,823 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 569 transitions. [2019-10-15 01:28:12,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 569 transitions. [2019-10-15 01:28:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:28:12,828 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:12,828 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, 1, 1] [2019-10-15 01:28:12,828 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1217914916, now seen corresponding path program 1 times [2019-10-15 01:28:12,829 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:12,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126034410] [2019-10-15 01:28:12,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:12,908 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:12,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126034410] [2019-10-15 01:28:12,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:12,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:12,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711733842] [2019-10-15 01:28:12,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:12,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:12,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:12,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:12,912 INFO L87 Difference]: Start difference. First operand 347 states and 569 transitions. Second operand 5 states. [2019-10-15 01:28:13,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:13,144 INFO L93 Difference]: Finished difference Result 683 states and 1123 transitions. [2019-10-15 01:28:13,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:13,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-15 01:28:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:13,147 INFO L225 Difference]: With dead ends: 683 [2019-10-15 01:28:13,147 INFO L226 Difference]: Without dead ends: 349 [2019-10-15 01:28:13,148 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,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-15 01:28:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2019-10-15 01:28:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-15 01:28:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 565 transitions. [2019-10-15 01:28:13,163 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 565 transitions. Word has length 104 [2019-10-15 01:28:13,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:13,164 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 565 transitions. [2019-10-15 01:28:13,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:13,164 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 565 transitions. [2019-10-15 01:28:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:13,166 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:13,166 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, 1, 1, 1] [2019-10-15 01:28:13,166 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:13,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1213371254, now seen corresponding path program 1 times [2019-10-15 01:28:13,167 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:13,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150526627] [2019-10-15 01:28:13,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,221 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:13,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150526627] [2019-10-15 01:28:13,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:13,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:13,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733691061] [2019-10-15 01:28:13,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:13,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:13,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:13,224 INFO L87 Difference]: Start difference. First operand 347 states and 565 transitions. Second operand 5 states. [2019-10-15 01:28:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:13,419 INFO L93 Difference]: Finished difference Result 717 states and 1175 transitions. [2019-10-15 01:28:13,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:13,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:13,422 INFO L225 Difference]: With dead ends: 717 [2019-10-15 01:28:13,422 INFO L226 Difference]: Without dead ends: 383 [2019-10-15 01:28:13,423 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,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-15 01:28:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 374. [2019-10-15 01:28:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-15 01:28:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 607 transitions. [2019-10-15 01:28:13,439 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 607 transitions. Word has length 106 [2019-10-15 01:28:13,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:13,439 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 607 transitions. [2019-10-15 01:28:13,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 607 transitions. [2019-10-15 01:28:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:28:13,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:13,441 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, 1, 1, 1] [2019-10-15 01:28:13,442 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:13,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:13,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1820780382, now seen corresponding path program 1 times [2019-10-15 01:28:13,442 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:13,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261701422] [2019-10-15 01:28:13,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,495 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:13,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261701422] [2019-10-15 01:28:13,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:13,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:13,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935438625] [2019-10-15 01:28:13,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:13,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:13,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:13,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:13,497 INFO L87 Difference]: Start difference. First operand 374 states and 607 transitions. Second operand 5 states. [2019-10-15 01:28:13,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:13,693 INFO L93 Difference]: Finished difference Result 744 states and 1212 transitions. [2019-10-15 01:28:13,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:13,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-15 01:28:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:13,697 INFO L225 Difference]: With dead ends: 744 [2019-10-15 01:28:13,697 INFO L226 Difference]: Without dead ends: 383 [2019-10-15 01:28:13,698 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,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-15 01:28:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 374. [2019-10-15 01:28:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-15 01:28:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 602 transitions. [2019-10-15 01:28:13,717 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 602 transitions. Word has length 107 [2019-10-15 01:28:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:13,717 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 602 transitions. [2019-10-15 01:28:13,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 602 transitions. [2019-10-15 01:28:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 01:28:13,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:13,720 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, 1, 1, 1, 1] [2019-10-15 01:28:13,720 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:13,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1208949664, now seen corresponding path program 1 times [2019-10-15 01:28:13,721 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:13,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075270275] [2019-10-15 01:28:13,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,805 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:13,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075270275] [2019-10-15 01:28:13,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:13,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:13,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617622793] [2019-10-15 01:28:13,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:13,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:13,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:13,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:13,807 INFO L87 Difference]: Start difference. First operand 374 states and 602 transitions. Second operand 5 states. [2019-10-15 01:28:14,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,014 INFO L93 Difference]: Finished difference Result 772 states and 1247 transitions. [2019-10-15 01:28:14,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:14,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-10-15 01:28:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,017 INFO L225 Difference]: With dead ends: 772 [2019-10-15 01:28:14,017 INFO L226 Difference]: Without dead ends: 411 [2019-10-15 01:28:14,018 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,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-15 01:28:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2019-10-15 01:28:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-15 01:28:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 655 transitions. [2019-10-15 01:28:14,036 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 655 transitions. Word has length 115 [2019-10-15 01:28:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,036 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 655 transitions. [2019-10-15 01:28:14,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 655 transitions. [2019-10-15 01:28:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:28:14,038 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,038 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, 1, 1, 1, 1] [2019-10-15 01:28:14,038 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,039 INFO L82 PathProgramCache]: Analyzing trace with hash 523971907, now seen corresponding path program 1 times [2019-10-15 01:28:14,039 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703180982] [2019-10-15 01:28:14,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,090 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:14,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703180982] [2019-10-15 01:28:14,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:14,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:14,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525732873] [2019-10-15 01:28:14,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:14,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:14,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:14,093 INFO L87 Difference]: Start difference. First operand 408 states and 655 transitions. Second operand 5 states. [2019-10-15 01:28:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,302 INFO L93 Difference]: Finished difference Result 806 states and 1297 transitions. [2019-10-15 01:28:14,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:14,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-10-15 01:28:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,305 INFO L225 Difference]: With dead ends: 806 [2019-10-15 01:28:14,305 INFO L226 Difference]: Without dead ends: 411 [2019-10-15 01:28:14,307 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,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-15 01:28:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2019-10-15 01:28:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-15 01:28:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 652 transitions. [2019-10-15 01:28:14,324 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 652 transitions. Word has length 116 [2019-10-15 01:28:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,325 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 652 transitions. [2019-10-15 01:28:14,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 652 transitions. [2019-10-15 01:28:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:28:14,327 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,327 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, 1] [2019-10-15 01:28:14,327 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1148759440, now seen corresponding path program 1 times [2019-10-15 01:28:14,328 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097826100] [2019-10-15 01:28:14,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,384 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:14,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097826100] [2019-10-15 01:28:14,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:14,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:14,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344052018] [2019-10-15 01:28:14,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:14,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:14,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:14,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:14,387 INFO L87 Difference]: Start difference. First operand 408 states and 652 transitions. Second operand 5 states. [2019-10-15 01:28:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,640 INFO L93 Difference]: Finished difference Result 851 states and 1363 transitions. [2019-10-15 01:28:14,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:14,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-10-15 01:28:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,644 INFO L225 Difference]: With dead ends: 851 [2019-10-15 01:28:14,645 INFO L226 Difference]: Without dead ends: 456 [2019-10-15 01:28:14,646 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,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-15 01:28:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 450. [2019-10-15 01:28:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-15 01:28:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 717 transitions. [2019-10-15 01:28:14,669 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 717 transitions. Word has length 119 [2019-10-15 01:28:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,669 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 717 transitions. [2019-10-15 01:28:14,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:14,670 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 717 transitions. [2019-10-15 01:28:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:14,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,672 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, 1, 1] [2019-10-15 01:28:14,672 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,672 INFO L82 PathProgramCache]: Analyzing trace with hash 669551219, now seen corresponding path program 1 times [2019-10-15 01:28:14,673 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052067049] [2019-10-15 01:28:14,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,739 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:14,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052067049] [2019-10-15 01:28:14,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:14,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:14,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165916021] [2019-10-15 01:28:14,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:14,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:14,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:14,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:14,741 INFO L87 Difference]: Start difference. First operand 450 states and 717 transitions. Second operand 5 states. [2019-10-15 01:28:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,976 INFO L93 Difference]: Finished difference Result 897 states and 1434 transitions. [2019-10-15 01:28:14,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:14,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,979 INFO L225 Difference]: With dead ends: 897 [2019-10-15 01:28:14,979 INFO L226 Difference]: Without dead ends: 458 [2019-10-15 01:28:14,981 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,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-15 01:28:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 452. [2019-10-15 01:28:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-15 01:28:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 720 transitions. [2019-10-15 01:28:15,000 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 720 transitions. Word has length 120 [2019-10-15 01:28:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:15,001 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 720 transitions. [2019-10-15 01:28:15,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 720 transitions. [2019-10-15 01:28:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:28:15,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:15,003 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, 1, 1, 1] [2019-10-15 01:28:15,003 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:15,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,004 INFO L82 PathProgramCache]: Analyzing trace with hash 534907766, now seen corresponding path program 1 times [2019-10-15 01:28:15,004 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:15,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149515963] [2019-10-15 01:28:15,004 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,004 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,059 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:15,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149515963] [2019-10-15 01:28:15,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:15,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678213303] [2019-10-15 01:28:15,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:15,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:15,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:15,061 INFO L87 Difference]: Start difference. First operand 452 states and 720 transitions. Second operand 5 states. [2019-10-15 01:28:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:15,282 INFO L93 Difference]: Finished difference Result 930 states and 1489 transitions. [2019-10-15 01:28:15,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:15,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-10-15 01:28:15,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:15,285 INFO L225 Difference]: With dead ends: 930 [2019-10-15 01:28:15,285 INFO L226 Difference]: Without dead ends: 491 [2019-10-15 01:28:15,287 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,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-15 01:28:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2019-10-15 01:28:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-15 01:28:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 755 transitions. [2019-10-15 01:28:15,309 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 755 transitions. Word has length 132 [2019-10-15 01:28:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:15,309 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 755 transitions. [2019-10-15 01:28:15,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 755 transitions. [2019-10-15 01:28:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:28:15,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:15,312 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, 1, 1, 1] [2019-10-15 01:28:15,312 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,313 INFO L82 PathProgramCache]: Analyzing trace with hash 535914030, now seen corresponding path program 1 times [2019-10-15 01:28:15,313 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:15,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765648767] [2019-10-15 01:28:15,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,416 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:15,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765648767] [2019-10-15 01:28:15,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:15,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063720068] [2019-10-15 01:28:15,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:15,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:15,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:15,419 INFO L87 Difference]: Start difference. First operand 477 states and 755 transitions. Second operand 5 states. [2019-10-15 01:28:15,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:15,716 INFO L93 Difference]: Finished difference Result 955 states and 1516 transitions. [2019-10-15 01:28:15,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:15,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-15 01:28:15,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:15,721 INFO L225 Difference]: With dead ends: 955 [2019-10-15 01:28:15,721 INFO L226 Difference]: Without dead ends: 491 [2019-10-15 01:28:15,723 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,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-15 01:28:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2019-10-15 01:28:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-15 01:28:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 747 transitions. [2019-10-15 01:28:15,762 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 747 transitions. Word has length 133 [2019-10-15 01:28:15,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:15,763 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 747 transitions. [2019-10-15 01:28:15,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 747 transitions. [2019-10-15 01:28:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:28:15,768 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:15,768 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, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:15,768 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:15,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1278605743, now seen corresponding path program 1 times [2019-10-15 01:28:15,769 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:15,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574981424] [2019-10-15 01:28:15,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,856 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:15,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574981424] [2019-10-15 01:28:15,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:15,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371688256] [2019-10-15 01:28:15,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:15,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:15,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:15,861 INFO L87 Difference]: Start difference. First operand 477 states and 747 transitions. Second operand 5 states. [2019-10-15 01:28:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:16,169 INFO L93 Difference]: Finished difference Result 947 states and 1486 transitions. [2019-10-15 01:28:16,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:16,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-15 01:28:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:16,174 INFO L225 Difference]: With dead ends: 947 [2019-10-15 01:28:16,174 INFO L226 Difference]: Without dead ends: 483 [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 483 states. [2019-10-15 01:28:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 477. [2019-10-15 01:28:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-15 01:28:16,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 742 transitions. [2019-10-15 01:28:16,217 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 742 transitions. Word has length 148 [2019-10-15 01:28:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:16,217 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 742 transitions. [2019-10-15 01:28:16,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 742 transitions. [2019-10-15 01:28:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:28:16,222 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:16,222 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, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:16,223 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1353663186, now seen corresponding path program 1 times [2019-10-15 01:28:16,224 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:16,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243899520] [2019-10-15 01:28:16,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:16,328 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:16,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243899520] [2019-10-15 01:28:16,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:16,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:16,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446138078] [2019-10-15 01:28:16,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:16,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:16,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:16,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:16,331 INFO L87 Difference]: Start difference. First operand 477 states and 742 transitions. Second operand 5 states. [2019-10-15 01:28:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:16,682 INFO L93 Difference]: Finished difference Result 947 states and 1476 transitions. [2019-10-15 01:28:16,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:16,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-10-15 01:28:16,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:16,686 INFO L225 Difference]: With dead ends: 947 [2019-10-15 01:28:16,687 INFO L226 Difference]: Without dead ends: 483 [2019-10-15 01:28:16,688 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,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-15 01:28:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 477. [2019-10-15 01:28:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-15 01:28:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 737 transitions. [2019-10-15 01:28:16,723 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 737 transitions. Word has length 149 [2019-10-15 01:28:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:16,724 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 737 transitions. [2019-10-15 01:28:16,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 737 transitions. [2019-10-15 01:28:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:28:16,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:16,729 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, 1, 1, 1] [2019-10-15 01:28:16,729 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1186463222, now seen corresponding path program 1 times [2019-10-15 01:28:16,730 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:16,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542886482] [2019-10-15 01:28:16,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:16,832 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:16,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542886482] [2019-10-15 01:28:16,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:16,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:16,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330377428] [2019-10-15 01:28:16,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:16,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:16,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:16,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:16,844 INFO L87 Difference]: Start difference. First operand 477 states and 737 transitions. Second operand 5 states. [2019-10-15 01:28:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:17,120 INFO L93 Difference]: Finished difference Result 970 states and 1504 transitions. [2019-10-15 01:28:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:17,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-15 01:28:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:17,124 INFO L225 Difference]: With dead ends: 970 [2019-10-15 01:28:17,125 INFO L226 Difference]: Without dead ends: 506 [2019-10-15 01:28:17,131 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,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-15 01:28:17,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 501. [2019-10-15 01:28:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-10-15 01:28:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 768 transitions. [2019-10-15 01:28:17,174 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 768 transitions. Word has length 153 [2019-10-15 01:28:17,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:17,175 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 768 transitions. [2019-10-15 01:28:17,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 768 transitions. [2019-10-15 01:28:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:28:17,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:17,179 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, 1, 1, 1] [2019-10-15 01:28:17,180 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:17,181 INFO L82 PathProgramCache]: Analyzing trace with hash 320058782, now seen corresponding path program 1 times [2019-10-15 01:28:17,181 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:17,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936464508] [2019-10-15 01:28:17,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:17,306 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:17,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936464508] [2019-10-15 01:28:17,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:17,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:17,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487347302] [2019-10-15 01:28:17,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:17,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:17,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:17,310 INFO L87 Difference]: Start difference. First operand 501 states and 768 transitions. Second operand 5 states. [2019-10-15 01:28:17,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:17,576 INFO L93 Difference]: Finished difference Result 994 states and 1526 transitions. [2019-10-15 01:28:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:17,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-10-15 01:28:17,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:17,581 INFO L225 Difference]: With dead ends: 994 [2019-10-15 01:28:17,582 INFO L226 Difference]: Without dead ends: 506 [2019-10-15 01:28:17,583 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,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-15 01:28:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 501. [2019-10-15 01:28:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-10-15 01:28:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 759 transitions. [2019-10-15 01:28:17,615 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 759 transitions. Word has length 154 [2019-10-15 01:28:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:17,616 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 759 transitions. [2019-10-15 01:28:17,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 759 transitions. [2019-10-15 01:28:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:28:17,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:17,618 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, 1, 1] [2019-10-15 01:28:17,618 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:17,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:17,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1626033845, now seen corresponding path program 1 times [2019-10-15 01:28:17,619 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:17,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211019724] [2019-10-15 01:28:17,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,620 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:17,690 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:17,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211019724] [2019-10-15 01:28:17,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:17,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:17,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967366410] [2019-10-15 01:28:17,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:17,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:17,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:17,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:17,695 INFO L87 Difference]: Start difference. First operand 501 states and 759 transitions. Second operand 5 states. [2019-10-15 01:28:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:17,946 INFO L93 Difference]: Finished difference Result 1037 states and 1569 transitions. [2019-10-15 01:28:17,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:17,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-15 01:28:17,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:17,950 INFO L225 Difference]: With dead ends: 1037 [2019-10-15 01:28:17,951 INFO L226 Difference]: Without dead ends: 549 [2019-10-15 01:28:17,952 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,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-10-15 01:28:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 542. [2019-10-15 01:28:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-15 01:28:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 814 transitions. [2019-10-15 01:28:17,978 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 814 transitions. Word has length 159 [2019-10-15 01:28:17,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:17,979 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 814 transitions. [2019-10-15 01:28:17,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 814 transitions. [2019-10-15 01:28:17,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-15 01:28:17,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:17,982 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, 1, 1] [2019-10-15 01:28:17,982 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:17,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:17,983 INFO L82 PathProgramCache]: Analyzing trace with hash 885119950, now seen corresponding path program 1 times [2019-10-15 01:28:17,984 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:17,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369256361] [2019-10-15 01:28:17,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:18,078 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:18,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369256361] [2019-10-15 01:28:18,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:18,080 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:18,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408617408] [2019-10-15 01:28:18,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:18,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:18,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:18,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:18,083 INFO L87 Difference]: Start difference. First operand 542 states and 814 transitions. Second operand 5 states. [2019-10-15 01:28:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:18,408 INFO L93 Difference]: Finished difference Result 1078 states and 1622 transitions. [2019-10-15 01:28:18,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:18,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-15 01:28:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:18,413 INFO L225 Difference]: With dead ends: 1078 [2019-10-15 01:28:18,413 INFO L226 Difference]: Without dead ends: 530 [2019-10-15 01:28:18,417 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,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-10-15 01:28:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 523. [2019-10-15 01:28:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-10-15 01:28:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 784 transitions. [2019-10-15 01:28:18,457 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 784 transitions. Word has length 160 [2019-10-15 01:28:18,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:18,457 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 784 transitions. [2019-10-15 01:28:18,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 784 transitions. [2019-10-15 01:28:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-15 01:28:18,462 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,463 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, 1, 1, 1] [2019-10-15 01:28:18,463 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1076584642, now seen corresponding path program 1 times [2019-10-15 01:28:18,464 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749228758] [2019-10-15 01:28:18,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:18,574 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:18,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749228758] [2019-10-15 01:28:18,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:18,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:18,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318099839] [2019-10-15 01:28:18,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:18,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:18,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:18,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:18,577 INFO L87 Difference]: Start difference. First operand 523 states and 784 transitions. Second operand 5 states. [2019-10-15 01:28:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:18,864 INFO L93 Difference]: Finished difference Result 1058 states and 1592 transitions. [2019-10-15 01:28:18,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:18,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-10-15 01:28:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:18,869 INFO L225 Difference]: With dead ends: 1058 [2019-10-15 01:28:18,869 INFO L226 Difference]: Without dead ends: 548 [2019-10-15 01:28:18,871 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,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-15 01:28:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 544. [2019-10-15 01:28:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-15 01:28:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 808 transitions. [2019-10-15 01:28:18,923 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 808 transitions. Word has length 174 [2019-10-15 01:28:18,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:18,924 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 808 transitions. [2019-10-15 01:28:18,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 808 transitions. [2019-10-15 01:28:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-15 01:28:18,929 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,930 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, 1, 1, 1] [2019-10-15 01:28:18,930 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,931 INFO L82 PathProgramCache]: Analyzing trace with hash 415925946, now seen corresponding path program 1 times [2019-10-15 01:28:18,931 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247090522] [2019-10-15 01:28:18,931 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:19,094 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:19,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247090522] [2019-10-15 01:28:19,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:19,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:19,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223812581] [2019-10-15 01:28:19,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:19,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:19,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:19,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:19,098 INFO L87 Difference]: Start difference. First operand 544 states and 808 transitions. Second operand 5 states. [2019-10-15 01:28:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:19,393 INFO L93 Difference]: Finished difference Result 1079 states and 1605 transitions. [2019-10-15 01:28:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:19,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-10-15 01:28:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:19,398 INFO L225 Difference]: With dead ends: 1079 [2019-10-15 01:28:19,399 INFO L226 Difference]: Without dead ends: 546 [2019-10-15 01:28:19,403 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,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-15 01:28:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 542. [2019-10-15 01:28:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-15 01:28:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 794 transitions. [2019-10-15 01:28:19,444 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 794 transitions. Word has length 175 [2019-10-15 01:28:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:19,444 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 794 transitions. [2019-10-15 01:28:19,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 794 transitions. [2019-10-15 01:28:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-15 01:28:19,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:19,448 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, 1, 1, 1] [2019-10-15 01:28:19,448 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1910899715, now seen corresponding path program 1 times [2019-10-15 01:28:19,449 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:19,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515078729] [2019-10-15 01:28:19,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-15 01:28:19,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515078729] [2019-10-15 01:28:19,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:19,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:19,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475918763] [2019-10-15 01:28:19,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:19,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:19,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:19,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:19,519 INFO L87 Difference]: Start difference. First operand 542 states and 794 transitions. Second operand 3 states. [2019-10-15 01:28:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:19,576 INFO L93 Difference]: Finished difference Result 1593 states and 2335 transitions. [2019-10-15 01:28:19,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:19,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-15 01:28:19,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:19,582 INFO L225 Difference]: With dead ends: 1593 [2019-10-15 01:28:19,582 INFO L226 Difference]: Without dead ends: 1064 [2019-10-15 01:28:19,584 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:19,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2019-10-15 01:28:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 543. [2019-10-15 01:28:19,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-10-15 01:28:19,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 795 transitions. [2019-10-15 01:28:19,621 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 795 transitions. Word has length 190 [2019-10-15 01:28:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:19,621 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 795 transitions. [2019-10-15 01:28:19,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 795 transitions. [2019-10-15 01:28:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-15 01:28:19,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:19,624 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, 1, 1, 1] [2019-10-15 01:28:19,624 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:19,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:19,625 INFO L82 PathProgramCache]: Analyzing trace with hash 44191041, now seen corresponding path program 1 times [2019-10-15 01:28:19,625 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:19,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061335363] [2019-10-15 01:28:19,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-15 01:28:19,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061335363] [2019-10-15 01:28:19,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:19,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:19,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473482997] [2019-10-15 01:28:19,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:19,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:19,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:19,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:19,710 INFO L87 Difference]: Start difference. First operand 543 states and 795 transitions. Second operand 3 states. [2019-10-15 01:28:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:19,851 INFO L93 Difference]: Finished difference Result 1601 states and 2350 transitions. [2019-10-15 01:28:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:19,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-15 01:28:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:19,858 INFO L225 Difference]: With dead ends: 1601 [2019-10-15 01:28:19,858 INFO L226 Difference]: Without dead ends: 1071 [2019-10-15 01:28:19,860 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:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2019-10-15 01:28:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2019-10-15 01:28:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-10-15 01:28:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1553 transitions. [2019-10-15 01:28:19,935 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1553 transitions. Word has length 190 [2019-10-15 01:28:19,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:19,936 INFO L462 AbstractCegarLoop]: Abstraction has 1071 states and 1553 transitions. [2019-10-15 01:28:19,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1553 transitions. [2019-10-15 01:28:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-15 01:28:19,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:19,940 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, 1, 1, 1, 1, 1] [2019-10-15 01:28:19,941 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:19,941 INFO L82 PathProgramCache]: Analyzing trace with hash 402721867, now seen corresponding path program 1 times [2019-10-15 01:28:19,941 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:19,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434229990] [2019-10-15 01:28:19,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-15 01:28:20,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434229990] [2019-10-15 01:28:20,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:20,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:20,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23383513] [2019-10-15 01:28:20,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:20,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:20,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:20,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:20,023 INFO L87 Difference]: Start difference. First operand 1071 states and 1553 transitions. Second operand 3 states. [2019-10-15 01:28:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:20,199 INFO L93 Difference]: Finished difference Result 2657 states and 3866 transitions. [2019-10-15 01:28:20,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:20,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-15 01:28:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:20,208 INFO L225 Difference]: With dead ends: 2657 [2019-10-15 01:28:20,208 INFO L226 Difference]: Without dead ends: 1599 [2019-10-15 01:28:20,211 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:20,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2019-10-15 01:28:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2019-10-15 01:28:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1599 states. [2019-10-15 01:28:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2312 transitions. [2019-10-15 01:28:20,293 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2312 transitions. Word has length 192 [2019-10-15 01:28:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:20,294 INFO L462 AbstractCegarLoop]: Abstraction has 1599 states and 2312 transitions. [2019-10-15 01:28:20,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2312 transitions. [2019-10-15 01:28:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-15 01:28:20,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:20,299 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, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:20,300 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1637292960, now seen corresponding path program 1 times [2019-10-15 01:28:20,300 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:20,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467405203] [2019-10-15 01:28:20,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,391 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:20,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467405203] [2019-10-15 01:28:20,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748621127] [2019-10-15 01:28:20,393 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:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:20,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-15 01:28:20,610 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-15 01:28:20,711 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:20,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-15 01:28:20,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132314318] [2019-10-15 01:28:20,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:20,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:20,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:20,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:20,713 INFO L87 Difference]: Start difference. First operand 1599 states and 2312 transitions. Second operand 4 states. [2019-10-15 01:28:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:21,019 INFO L93 Difference]: Finished difference Result 4241 states and 6161 transitions. [2019-10-15 01:28:21,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:21,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-10-15 01:28:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:21,033 INFO L225 Difference]: With dead ends: 4241 [2019-10-15 01:28:21,034 INFO L226 Difference]: Without dead ends: 2655 [2019-10-15 01:28:21,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 385 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,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2019-10-15 01:28:21,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2655. [2019-10-15 01:28:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2655 states. [2019-10-15 01:28:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3849 transitions. [2019-10-15 01:28:21,249 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3849 transitions. Word has length 193 [2019-10-15 01:28:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:21,249 INFO L462 AbstractCegarLoop]: Abstraction has 2655 states and 3849 transitions. [2019-10-15 01:28:21,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3849 transitions. [2019-10-15 01:28:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-10-15 01:28:21,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:21,268 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:21,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:21,485 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:21,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:21,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1635655158, now seen corresponding path program 1 times [2019-10-15 01:28:21,486 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:21,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111432109] [2019-10-15 01:28:21,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 830 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2019-10-15 01:28:21,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111432109] [2019-10-15 01:28:21,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:21,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:21,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36778263] [2019-10-15 01:28:21,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:21,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:21,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:21,722 INFO L87 Difference]: Start difference. First operand 2655 states and 3849 transitions. Second operand 3 states. [2019-10-15 01:28:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,049 INFO L93 Difference]: Finished difference Result 5462 states and 7921 transitions. [2019-10-15 01:28:22,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:22,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 374 [2019-10-15 01:28:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,067 INFO L225 Difference]: With dead ends: 5462 [2019-10-15 01:28:22,067 INFO L226 Difference]: Without dead ends: 2820 [2019-10-15 01:28:22,084 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,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2019-10-15 01:28:22,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2750. [2019-10-15 01:28:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2750 states. [2019-10-15 01:28:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3774 transitions. [2019-10-15 01:28:22,272 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3774 transitions. Word has length 374 [2019-10-15 01:28:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:22,273 INFO L462 AbstractCegarLoop]: Abstraction has 2750 states and 3774 transitions. [2019-10-15 01:28:22,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3774 transitions. [2019-10-15 01:28:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-10-15 01:28:22,285 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:22,285 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:22,286 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:22,286 INFO L82 PathProgramCache]: Analyzing trace with hash 649580849, now seen corresponding path program 1 times [2019-10-15 01:28:22,287 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:22,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679008588] [2019-10-15 01:28:22,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1443 backedges. 881 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-10-15 01:28:22,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679008588] [2019-10-15 01:28:22,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:22,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:22,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377117333] [2019-10-15 01:28:22,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:22,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:22,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:22,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:22,487 INFO L87 Difference]: Start difference. First operand 2750 states and 3774 transitions. Second operand 3 states. [2019-10-15 01:28:22,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,775 INFO L93 Difference]: Finished difference Result 8089 states and 11108 transitions. [2019-10-15 01:28:22,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:22,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-10-15 01:28:22,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,823 INFO L225 Difference]: With dead ends: 8089 [2019-10-15 01:28:22,823 INFO L226 Difference]: Without dead ends: 5352 [2019-10-15 01:28:22,831 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,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5352 states. [2019-10-15 01:28:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5352 to 5350. [2019-10-15 01:28:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5350 states. [2019-10-15 01:28:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5350 states to 5350 states and 7335 transitions. [2019-10-15 01:28:23,171 INFO L78 Accepts]: Start accepts. Automaton has 5350 states and 7335 transitions. Word has length 376 [2019-10-15 01:28:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:23,172 INFO L462 AbstractCegarLoop]: Abstraction has 5350 states and 7335 transitions. [2019-10-15 01:28:23,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:23,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5350 states and 7335 transitions. [2019-10-15 01:28:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-10-15 01:28:23,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:23,189 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,189 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:23,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:23,190 INFO L82 PathProgramCache]: Analyzing trace with hash -398395516, now seen corresponding path program 1 times [2019-10-15 01:28:23,190 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:23,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795255595] [2019-10-15 01:28:23,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2206 backedges. 1039 proven. 26 refuted. 0 times theorem prover too weak. 1141 trivial. 0 not checked. [2019-10-15 01:28:23,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795255595] [2019-10-15 01:28:23,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340108884] [2019-10-15 01:28:23,425 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:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:23,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:23,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2206 backedges. 1460 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2019-10-15 01:28:23,725 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2206 backedges. 1460 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2019-10-15 01:28:23,886 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:23,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-15 01:28:23,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488405864] [2019-10-15 01:28:23,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:23,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:23,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:23,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:23,889 INFO L87 Difference]: Start difference. First operand 5350 states and 7335 transitions. Second operand 4 states. [2019-10-15 01:28:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:24,344 INFO L93 Difference]: Finished difference Result 12821 states and 17619 transitions. [2019-10-15 01:28:24,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:24,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 440 [2019-10-15 01:28:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:24,362 INFO L225 Difference]: With dead ends: 12821 [2019-10-15 01:28:24,362 INFO L226 Difference]: Without dead ends: 7484 [2019-10-15 01:28:24,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 883 GetRequests, 879 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:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7484 states. [2019-10-15 01:28:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7484 to 7484. [2019-10-15 01:28:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7484 states. [2019-10-15 01:28:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7484 states to 7484 states and 10271 transitions. [2019-10-15 01:28:24,769 INFO L78 Accepts]: Start accepts. Automaton has 7484 states and 10271 transitions. Word has length 440 [2019-10-15 01:28:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:24,770 INFO L462 AbstractCegarLoop]: Abstraction has 7484 states and 10271 transitions. [2019-10-15 01:28:24,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 7484 states and 10271 transitions. [2019-10-15 01:28:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-10-15 01:28:24,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:24,791 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, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:24,999 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:24,999 INFO L82 PathProgramCache]: Analyzing trace with hash -482980055, now seen corresponding path program 1 times [2019-10-15 01:28:24,999 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:24,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220802267] [2019-10-15 01:28:25,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 1014 proven. 0 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2019-10-15 01:28:25,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220802267] [2019-10-15 01:28:25,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:25,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:25,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546473270] [2019-10-15 01:28:25,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:25,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:25,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:25,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:25,215 INFO L87 Difference]: Start difference. First operand 7484 states and 10271 transitions. Second operand 3 states. [2019-10-15 01:28:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:25,753 INFO L93 Difference]: Finished difference Result 15559 states and 21364 transitions. [2019-10-15 01:28:25,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:25,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 446 [2019-10-15 01:28:25,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:25,771 INFO L225 Difference]: With dead ends: 15559 [2019-10-15 01:28:25,771 INFO L226 Difference]: Without dead ends: 8088 [2019-10-15 01:28:25,785 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,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8088 states. [2019-10-15 01:28:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8088 to 8088. [2019-10-15 01:28:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8088 states. [2019-10-15 01:28:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8088 states to 8088 states and 11090 transitions. [2019-10-15 01:28:26,246 INFO L78 Accepts]: Start accepts. Automaton has 8088 states and 11090 transitions. Word has length 446 [2019-10-15 01:28:26,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:26,247 INFO L462 AbstractCegarLoop]: Abstraction has 8088 states and 11090 transitions. [2019-10-15 01:28:26,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 8088 states and 11090 transitions. [2019-10-15 01:28:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-15 01:28:26,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:26,265 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, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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:26,265 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:26,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1424007623, now seen corresponding path program 1 times [2019-10-15 01:28:26,266 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:26,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663066017] [2019-10-15 01:28:26,267 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:26,267 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:26,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 1120 proven. 0 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2019-10-15 01:28:26,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663066017] [2019-10-15 01:28:26,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:26,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:26,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108590748] [2019-10-15 01:28:26,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:26,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:26,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:26,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:26,505 INFO L87 Difference]: Start difference. First operand 8088 states and 11090 transitions. Second operand 3 states. [2019-10-15 01:28:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:26,996 INFO L93 Difference]: Finished difference Result 17176 states and 23574 transitions. [2019-10-15 01:28:26,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:26,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 447 [2019-10-15 01:28:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:27,015 INFO L225 Difference]: With dead ends: 17176 [2019-10-15 01:28:27,016 INFO L226 Difference]: Without dead ends: 9101 [2019-10-15 01:28:27,031 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:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9101 states. [2019-10-15 01:28:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9101 to 9101. [2019-10-15 01:28:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9101 states. [2019-10-15 01:28:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9101 states to 9101 states and 12467 transitions. [2019-10-15 01:28:27,440 INFO L78 Accepts]: Start accepts. Automaton has 9101 states and 12467 transitions. Word has length 447 [2019-10-15 01:28:27,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:27,441 INFO L462 AbstractCegarLoop]: Abstraction has 9101 states and 12467 transitions. [2019-10-15 01:28:27,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 9101 states and 12467 transitions. [2019-10-15 01:28:27,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-15 01:28:27,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:27,459 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, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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,460 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:27,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:27,460 INFO L82 PathProgramCache]: Analyzing trace with hash -300834615, now seen corresponding path program 1 times [2019-10-15 01:28:27,460 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:27,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534263687] [2019-10-15 01:28:27,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:27,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:27,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 1162 proven. 0 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [2019-10-15 01:28:27,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534263687] [2019-10-15 01:28:27,711 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:27,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:27,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987171066] [2019-10-15 01:28:27,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:27,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:27,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:27,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:27,714 INFO L87 Difference]: Start difference. First operand 9101 states and 12467 transitions. Second operand 3 states. [2019-10-15 01:28:28,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:28,145 INFO L93 Difference]: Finished difference Result 19178 states and 26302 transitions. [2019-10-15 01:28:28,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:28,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 447 [2019-10-15 01:28:28,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:28,168 INFO L225 Difference]: With dead ends: 19178 [2019-10-15 01:28:28,168 INFO L226 Difference]: Without dead ends: 10090 [2019-10-15 01:28:28,185 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:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10090 states. [2019-10-15 01:28:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10090 to 10090. [2019-10-15 01:28:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10090 states. [2019-10-15 01:28:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10090 states to 10090 states and 13812 transitions. [2019-10-15 01:28:28,717 INFO L78 Accepts]: Start accepts. Automaton has 10090 states and 13812 transitions. Word has length 447 [2019-10-15 01:28:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:28,718 INFO L462 AbstractCegarLoop]: Abstraction has 10090 states and 13812 transitions. [2019-10-15 01:28:28,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 10090 states and 13812 transitions. [2019-10-15 01:28:28,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-15 01:28:28,738 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:28,738 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, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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:28,739 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:28,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:28,739 INFO L82 PathProgramCache]: Analyzing trace with hash -269197493, now seen corresponding path program 1 times [2019-10-15 01:28:28,739 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:28,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035751815] [2019-10-15 01:28:28,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:28,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:28,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 1152 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-10-15 01:28:28,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035751815] [2019-10-15 01:28:28,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:28,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:28,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007513337] [2019-10-15 01:28:28,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:28,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:28,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:28,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:28,954 INFO L87 Difference]: Start difference. First operand 10090 states and 13812 transitions. Second operand 3 states. [2019-10-15 01:28:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:29,358 INFO L93 Difference]: Finished difference Result 21160 states and 28996 transitions. [2019-10-15 01:28:29,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:29,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 447 [2019-10-15 01:28:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:29,384 INFO L225 Difference]: With dead ends: 21160 [2019-10-15 01:28:29,384 INFO L226 Difference]: Without dead ends: 11083 [2019-10-15 01:28:29,402 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:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11083 states. [2019-10-15 01:28:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11083 to 11083. [2019-10-15 01:28:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11083 states. [2019-10-15 01:28:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11083 states to 11083 states and 15161 transitions. [2019-10-15 01:28:30,049 INFO L78 Accepts]: Start accepts. Automaton has 11083 states and 15161 transitions. Word has length 447 [2019-10-15 01:28:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:30,050 INFO L462 AbstractCegarLoop]: Abstraction has 11083 states and 15161 transitions. [2019-10-15 01:28:30,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 11083 states and 15161 transitions. [2019-10-15 01:28:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-10-15 01:28:30,080 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:30,081 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, 9, 8, 8, 7, 7, 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, 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:30,081 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:30,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash 782104140, now seen corresponding path program 1 times [2019-10-15 01:28:30,082 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:30,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346455751] [2019-10-15 01:28:30,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:30,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:30,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 1635 proven. 26 refuted. 0 times theorem prover too weak. 1443 trivial. 0 not checked. [2019-10-15 01:28:30,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346455751] [2019-10-15 01:28:30,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764030927] [2019-10-15 01:28:30,323 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:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:30,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:30,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 1635 proven. 0 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2019-10-15 01:28:30,679 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 1635 proven. 0 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2019-10-15 01:28:30,807 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:30,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-15 01:28:30,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014890487] [2019-10-15 01:28:30,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:30,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:30,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:30,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:30,809 INFO L87 Difference]: Start difference. First operand 11083 states and 15161 transitions. Second operand 4 states. [2019-10-15 01:28:31,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:31,335 INFO L93 Difference]: Finished difference Result 24287 states and 33267 transitions. [2019-10-15 01:28:31,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:31,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 556 [2019-10-15 01:28:31,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:31,356 INFO L225 Difference]: With dead ends: 24287 [2019-10-15 01:28:31,357 INFO L226 Difference]: Without dead ends: 13217 [2019-10-15 01:28:31,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1115 GetRequests, 1111 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:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13217 states. [2019-10-15 01:28:31,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13217 to 13217. [2019-10-15 01:28:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13217 states. [2019-10-15 01:28:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13217 states to 13217 states and 18107 transitions. [2019-10-15 01:28:31,978 INFO L78 Accepts]: Start accepts. Automaton has 13217 states and 18107 transitions. Word has length 556 [2019-10-15 01:28:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:31,978 INFO L462 AbstractCegarLoop]: Abstraction has 13217 states and 18107 transitions. [2019-10-15 01:28:31,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 13217 states and 18107 transitions. [2019-10-15 01:28:31,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2019-10-15 01:28:31,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:31,996 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:32,201 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:32,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:32,202 INFO L82 PathProgramCache]: Analyzing trace with hash 849334299, now seen corresponding path program 1 times [2019-10-15 01:28:32,202 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:32,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100898080] [2019-10-15 01:28:32,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:32,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:32,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5679 backedges. 3420 proven. 26 refuted. 0 times theorem prover too weak. 2233 trivial. 0 not checked. [2019-10-15 01:28:32,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100898080] [2019-10-15 01:28:32,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868423255] [2019-10-15 01:28:32,829 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:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:33,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:33,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5679 backedges. 2746 proven. 0 refuted. 0 times theorem prover too weak. 2933 trivial. 0 not checked. [2019-10-15 01:28:33,222 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5679 backedges. 2746 proven. 0 refuted. 0 times theorem prover too weak. 2933 trivial. 0 not checked. [2019-10-15 01:28:33,539 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:33,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:33,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068005110] [2019-10-15 01:28:33,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:33,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:33,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:33,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:33,542 INFO L87 Difference]: Start difference. First operand 13217 states and 18107 transitions. Second operand 3 states. [2019-10-15 01:28:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:34,026 INFO L93 Difference]: Finished difference Result 27438 states and 37614 transitions. [2019-10-15 01:28:34,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:34,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 748 [2019-10-15 01:28:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:34,050 INFO L225 Difference]: With dead ends: 27438 [2019-10-15 01:28:34,050 INFO L226 Difference]: Without dead ends: 14234 [2019-10-15 01:28:34,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1499 GetRequests, 1496 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:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14234 states. [2019-10-15 01:28:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14234 to 14234. [2019-10-15 01:28:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14234 states. [2019-10-15 01:28:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 19488 transitions. [2019-10-15 01:28:35,253 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 19488 transitions. Word has length 748 [2019-10-15 01:28:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:35,254 INFO L462 AbstractCegarLoop]: Abstraction has 14234 states and 19488 transitions. [2019-10-15 01:28:35,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:35,254 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 19488 transitions. [2019-10-15 01:28:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2019-10-15 01:28:35,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:35,271 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:35,472 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:35,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1652755750, now seen corresponding path program 1 times [2019-10-15 01:28:35,473 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:35,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367631145] [2019-10-15 01:28:35,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:35,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:35,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5680 backedges. 3420 proven. 26 refuted. 0 times theorem prover too weak. 2234 trivial. 0 not checked. [2019-10-15 01:28:35,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367631145] [2019-10-15 01:28:35,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399627996] [2019-10-15 01:28:35,814 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:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:35,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:35,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5680 backedges. 2911 proven. 0 refuted. 0 times theorem prover too weak. 2769 trivial. 0 not checked. [2019-10-15 01:28:36,271 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5680 backedges. 2911 proven. 0 refuted. 0 times theorem prover too weak. 2769 trivial. 0 not checked. [2019-10-15 01:28:36,473 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:36,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:36,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848407619] [2019-10-15 01:28:36,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:36,474 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:36,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:36,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:36,474 INFO L87 Difference]: Start difference. First operand 14234 states and 19488 transitions. Second operand 3 states. [2019-10-15 01:28:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:36,973 INFO L93 Difference]: Finished difference Result 29148 states and 39909 transitions. [2019-10-15 01:28:36,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:36,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 749 [2019-10-15 01:28:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:36,994 INFO L225 Difference]: With dead ends: 29148 [2019-10-15 01:28:36,994 INFO L226 Difference]: Without dead ends: 14927 [2019-10-15 01:28:37,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1501 GetRequests, 1498 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:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14927 states.