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_7.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:29:04,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:29:04,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:29:04,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:29:04,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:29:04,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:29:04,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:29:04,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:29:04,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:29:04,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:29:04,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:29:04,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:29:04,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:29:04,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:29:04,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:29:04,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:29:04,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:29:04,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:29:04,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:29:04,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:29:04,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:29:04,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:29:04,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:29:04,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:29:04,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:29:04,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:29:04,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:29:04,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:29:04,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:29:04,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:29:04,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:29:04,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:29:04,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:29:04,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:29:04,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:29:04,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:29:04,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:29:04,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:29:04,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:29:04,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:29:04,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:29:04,804 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-13 21:29:04,818 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:29:04,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:29:04,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:29:04,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:29:04,820 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:29:04,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:29:04,821 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:29:04,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:29:04,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:29:04,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:29:04,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:29:04,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:29:04,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:29:04,822 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:29:04,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:29:04,823 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:29:04,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:29:04,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:29:04,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:29:04,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:29:04,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:29:04,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:29:04,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:29:04,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:29:04,825 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:29:04,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:29:04,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:29:04,825 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:29:04,825 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-13 21:29:05,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:29:05,129 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:29:05,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:29:05,134 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:29:05,135 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:29:05,135 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-10-13 21:29:05,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4feaf5f/7d76b40e1f564f17bf737873860a4708/FLAGc3ac0f86c [2019-10-13 21:29:05,718 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:29:05,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-10-13 21:29:05,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4feaf5f/7d76b40e1f564f17bf737873860a4708/FLAGc3ac0f86c [2019-10-13 21:29:06,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4feaf5f/7d76b40e1f564f17bf737873860a4708 [2019-10-13 21:29:06,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:29:06,035 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:29:06,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:06,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:29:06,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:29:06,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:06" (1/1) ... [2019-10-13 21:29:06,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25a29690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:06, skipping insertion in model container [2019-10-13 21:29:06,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:06" (1/1) ... [2019-10-13 21:29:06,052 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:29:06,095 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:29:06,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:06,328 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:29:06,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:06,495 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:29:06,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:06 WrapperNode [2019-10-13 21:29:06,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:06,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:29:06,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:29:06,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:29:06,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:06" (1/1) ... [2019-10-13 21:29:06,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:06" (1/1) ... [2019-10-13 21:29:06,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:06" (1/1) ... [2019-10-13 21:29:06,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:06" (1/1) ... [2019-10-13 21:29:06,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:06" (1/1) ... [2019-10-13 21:29:06,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:06" (1/1) ... [2019-10-13 21:29:06,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:06" (1/1) ... [2019-10-13 21:29:06,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:29:06,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:29:06,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:29:06,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:29:06,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:06" (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-13 21:29:06,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:29:06,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:29:06,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-13 21:29:06,625 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:29:06,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:29:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:29:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:29:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 21:29:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 21:29:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-13 21:29:06,627 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:29:06,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:29:06,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:29:06,882 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:29:07,459 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-13 21:29:07,460 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-13 21:29:07,466 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:29:07,466 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:29:07,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:07 BoogieIcfgContainer [2019-10-13 21:29:07,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:29:07,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:29:07,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:29:07,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:29:07,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:29:06" (1/3) ... [2019-10-13 21:29:07,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b86c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:07, skipping insertion in model container [2019-10-13 21:29:07,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:06" (2/3) ... [2019-10-13 21:29:07,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b86c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:07, skipping insertion in model container [2019-10-13 21:29:07,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:07" (3/3) ... [2019-10-13 21:29:07,491 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2019-10-13 21:29:07,505 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:29:07,515 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:29:07,528 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:29:07,569 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:29:07,569 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:29:07,570 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:29:07,570 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:29:07,570 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:29:07,570 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:29:07,570 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:29:07,571 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:29:07,613 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-10-13 21:29:07,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 21:29:07,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:07,631 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] [2019-10-13 21:29:07,633 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1198514108, now seen corresponding path program 1 times [2019-10-13 21:29:07,649 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:07,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234678681] [2019-10-13 21:29:07,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:07,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:07,949 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-13 21:29:07,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234678681] [2019-10-13 21:29:07,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:07,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:07,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204651764] [2019-10-13 21:29:07,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:07,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:07,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:07,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:07,978 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-10-13 21:29:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:08,475 INFO L93 Difference]: Finished difference Result 338 states and 575 transitions. [2019-10-13 21:29:08,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:08,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-13 21:29:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:08,504 INFO L225 Difference]: With dead ends: 338 [2019-10-13 21:29:08,504 INFO L226 Difference]: Without dead ends: 176 [2019-10-13 21:29:08,512 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-13 21:29:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-13 21:29:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2019-10-13 21:29:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-13 21:29:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2019-10-13 21:29:08,579 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 38 [2019-10-13 21:29:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:08,579 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2019-10-13 21:29:08,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2019-10-13 21:29:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 21:29:08,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:08,582 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] [2019-10-13 21:29:08,582 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:08,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:08,583 INFO L82 PathProgramCache]: Analyzing trace with hash -733377836, now seen corresponding path program 1 times [2019-10-13 21:29:08,583 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:08,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217814736] [2019-10-13 21:29:08,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:08,716 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-13 21:29:08,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217814736] [2019-10-13 21:29:08,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:08,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:08,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788965608] [2019-10-13 21:29:08,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:08,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:08,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:08,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:08,720 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand 5 states. [2019-10-13 21:29:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,034 INFO L93 Difference]: Finished difference Result 356 states and 571 transitions. [2019-10-13 21:29:09,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:09,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-13 21:29:09,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,040 INFO L225 Difference]: With dead ends: 356 [2019-10-13 21:29:09,041 INFO L226 Difference]: Without dead ends: 204 [2019-10-13 21:29:09,043 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-13 21:29:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-13 21:29:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2019-10-13 21:29:09,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-13 21:29:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 311 transitions. [2019-10-13 21:29:09,090 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 311 transitions. Word has length 39 [2019-10-13 21:29:09,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,090 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 311 transitions. [2019-10-13 21:29:09,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 311 transitions. [2019-10-13 21:29:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 21:29:09,095 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,095 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] [2019-10-13 21:29:09,095 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2008699792, now seen corresponding path program 1 times [2019-10-13 21:29:09,097 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709031325] [2019-10-13 21:29:09,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:09,189 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-13 21:29:09,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709031325] [2019-10-13 21:29:09,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:09,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:09,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297926518] [2019-10-13 21:29:09,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:09,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:09,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:09,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:09,192 INFO L87 Difference]: Start difference. First operand 193 states and 311 transitions. Second operand 5 states. [2019-10-13 21:29:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,490 INFO L93 Difference]: Finished difference Result 417 states and 682 transitions. [2019-10-13 21:29:09,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:09,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-13 21:29:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,498 INFO L225 Difference]: With dead ends: 417 [2019-10-13 21:29:09,499 INFO L226 Difference]: Without dead ends: 237 [2019-10-13 21:29:09,500 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-13 21:29:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-13 21:29:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-10-13 21:29:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-13 21:29:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 380 transitions. [2019-10-13 21:29:09,520 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 380 transitions. Word has length 45 [2019-10-13 21:29:09,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,521 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 380 transitions. [2019-10-13 21:29:09,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 380 transitions. [2019-10-13 21:29:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 21:29:09,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,523 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] [2019-10-13 21:29:09,524 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2133173875, now seen corresponding path program 1 times [2019-10-13 21:29:09,527 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590898404] [2019-10-13 21:29:09,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:09,629 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-13 21:29:09,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590898404] [2019-10-13 21:29:09,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:09,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:09,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457866055] [2019-10-13 21:29:09,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:09,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:09,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:09,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:09,632 INFO L87 Difference]: Start difference. First operand 231 states and 380 transitions. Second operand 5 states. [2019-10-13 21:29:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,893 INFO L93 Difference]: Finished difference Result 466 states and 772 transitions. [2019-10-13 21:29:09,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:09,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-13 21:29:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,896 INFO L225 Difference]: With dead ends: 466 [2019-10-13 21:29:09,896 INFO L226 Difference]: Without dead ends: 248 [2019-10-13 21:29:09,898 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-13 21:29:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-13 21:29:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2019-10-13 21:29:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-13 21:29:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 401 transitions. [2019-10-13 21:29:09,913 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 401 transitions. Word has length 46 [2019-10-13 21:29:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,913 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 401 transitions. [2019-10-13 21:29:09,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 401 transitions. [2019-10-13 21:29:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 21:29:09,916 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,916 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:09,917 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,917 INFO L82 PathProgramCache]: Analyzing trace with hash 648824040, now seen corresponding path program 1 times [2019-10-13 21:29:09,917 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456415483] [2019-10-13 21:29:09,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:10,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456415483] [2019-10-13 21:29:10,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:10,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646665512] [2019-10-13 21:29:10,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:10,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:10,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:10,020 INFO L87 Difference]: Start difference. First operand 242 states and 401 transitions. Second operand 5 states. [2019-10-13 21:29:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,223 INFO L93 Difference]: Finished difference Result 510 states and 854 transitions. [2019-10-13 21:29:10,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:10,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-10-13 21:29:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,226 INFO L225 Difference]: With dead ends: 510 [2019-10-13 21:29:10,226 INFO L226 Difference]: Without dead ends: 281 [2019-10-13 21:29:10,228 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-13 21:29:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-13 21:29:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-10-13 21:29:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-13 21:29:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 444 transitions. [2019-10-13 21:29:10,248 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 444 transitions. Word has length 64 [2019-10-13 21:29:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,248 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 444 transitions. [2019-10-13 21:29:10,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 444 transitions. [2019-10-13 21:29:10,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 21:29:10,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,252 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,252 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,253 INFO L82 PathProgramCache]: Analyzing trace with hash 943009440, now seen corresponding path program 1 times [2019-10-13 21:29:10,253 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670194726] [2019-10-13 21:29:10,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:10,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670194726] [2019-10-13 21:29:10,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:10,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896439508] [2019-10-13 21:29:10,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:10,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:10,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:10,331 INFO L87 Difference]: Start difference. First operand 267 states and 444 transitions. Second operand 5 states. [2019-10-13 21:29:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,559 INFO L93 Difference]: Finished difference Result 535 states and 894 transitions. [2019-10-13 21:29:10,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:10,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-13 21:29:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,562 INFO L225 Difference]: With dead ends: 535 [2019-10-13 21:29:10,562 INFO L226 Difference]: Without dead ends: 281 [2019-10-13 21:29:10,563 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-13 21:29:10,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-13 21:29:10,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-10-13 21:29:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-13 21:29:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 441 transitions. [2019-10-13 21:29:10,576 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 441 transitions. Word has length 65 [2019-10-13 21:29:10,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,577 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 441 transitions. [2019-10-13 21:29:10,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:10,577 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 441 transitions. [2019-10-13 21:29:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 21:29:10,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,579 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:29:10,580 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1195194559, now seen corresponding path program 1 times [2019-10-13 21:29:10,581 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951981071] [2019-10-13 21:29:10,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:10,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951981071] [2019-10-13 21:29:10,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:10,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194830008] [2019-10-13 21:29:10,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:10,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:10,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:10,637 INFO L87 Difference]: Start difference. First operand 267 states and 441 transitions. Second operand 5 states. [2019-10-13 21:29:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,856 INFO L93 Difference]: Finished difference Result 552 states and 919 transitions. [2019-10-13 21:29:10,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:10,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-13 21:29:10,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,860 INFO L225 Difference]: With dead ends: 552 [2019-10-13 21:29:10,860 INFO L226 Difference]: Without dead ends: 298 [2019-10-13 21:29:10,861 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-13 21:29:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-13 21:29:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-10-13 21:29:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-13 21:29:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 493 transitions. [2019-10-13 21:29:10,878 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 493 transitions. Word has length 66 [2019-10-13 21:29:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,878 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 493 transitions. [2019-10-13 21:29:10,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 493 transitions. [2019-10-13 21:29:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 21:29:10,881 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,881 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, 1, 1, 1, 1, 1, 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-13 21:29:10,881 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,882 INFO L82 PathProgramCache]: Analyzing trace with hash -379332949, now seen corresponding path program 1 times [2019-10-13 21:29:10,882 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924659043] [2019-10-13 21:29:10,882 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:29:10,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924659043] [2019-10-13 21:29:10,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:10,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304189517] [2019-10-13 21:29:10,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:10,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:10,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:10,942 INFO L87 Difference]: Start difference. First operand 298 states and 493 transitions. Second operand 5 states. [2019-10-13 21:29:11,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,144 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-13 21:29:11,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:11,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-13 21:29:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,147 INFO L225 Difference]: With dead ends: 600 [2019-10-13 21:29:11,147 INFO L226 Difference]: Without dead ends: 315 [2019-10-13 21:29:11,149 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-13 21:29:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-10-13 21:29:11,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2019-10-13 21:29:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-10-13 21:29:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 514 transitions. [2019-10-13 21:29:11,165 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 514 transitions. Word has length 78 [2019-10-13 21:29:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,165 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 514 transitions. [2019-10-13 21:29:11,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 514 transitions. [2019-10-13 21:29:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 21:29:11,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,167 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] [2019-10-13 21:29:11,167 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,168 INFO L82 PathProgramCache]: Analyzing trace with hash 314969472, now seen corresponding path program 1 times [2019-10-13 21:29:11,168 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853584982] [2019-10-13 21:29:11,168 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,168 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,239 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-13 21:29:11,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853584982] [2019-10-13 21:29:11,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:11,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:11,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019692134] [2019-10-13 21:29:11,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:11,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:11,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:11,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:11,243 INFO L87 Difference]: Start difference. First operand 313 states and 514 transitions. Second operand 5 states. [2019-10-13 21:29:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,490 INFO L93 Difference]: Finished difference Result 651 states and 1075 transitions. [2019-10-13 21:29:11,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:11,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-13 21:29:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,493 INFO L225 Difference]: With dead ends: 651 [2019-10-13 21:29:11,493 INFO L226 Difference]: Without dead ends: 351 [2019-10-13 21:29:11,494 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-13 21:29:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-13 21:29:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-13 21:29:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-13 21:29:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 574 transitions. [2019-10-13 21:29:11,512 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 574 transitions. Word has length 78 [2019-10-13 21:29:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,513 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 574 transitions. [2019-10-13 21:29:11,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 574 transitions. [2019-10-13 21:29:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-13 21:29:11,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,516 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, 1, 1, 1, 1, 1, 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-13 21:29:11,517 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,517 INFO L82 PathProgramCache]: Analyzing trace with hash 496741763, now seen corresponding path program 1 times [2019-10-13 21:29:11,518 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920768184] [2019-10-13 21:29:11,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:29:11,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920768184] [2019-10-13 21:29:11,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:11,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:11,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26730571] [2019-10-13 21:29:11,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:11,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:11,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:11,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:11,601 INFO L87 Difference]: Start difference. First operand 349 states and 574 transitions. Second operand 5 states. [2019-10-13 21:29:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,800 INFO L93 Difference]: Finished difference Result 687 states and 1133 transitions. [2019-10-13 21:29:11,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:11,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-13 21:29:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,803 INFO L225 Difference]: With dead ends: 687 [2019-10-13 21:29:11,804 INFO L226 Difference]: Without dead ends: 351 [2019-10-13 21:29:11,806 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-13 21:29:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-13 21:29:11,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-13 21:29:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-13 21:29:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 568 transitions. [2019-10-13 21:29:11,828 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 568 transitions. Word has length 79 [2019-10-13 21:29:11,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,828 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 568 transitions. [2019-10-13 21:29:11,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:11,829 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 568 transitions. [2019-10-13 21:29:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-13 21:29:11,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,831 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] [2019-10-13 21:29:11,831 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,832 INFO L82 PathProgramCache]: Analyzing trace with hash -70012323, now seen corresponding path program 1 times [2019-10-13 21:29:11,832 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73229301] [2019-10-13 21:29:11,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,939 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-13 21:29:11,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73229301] [2019-10-13 21:29:11,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:11,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:11,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145976801] [2019-10-13 21:29:11,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:11,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:11,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:11,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:11,942 INFO L87 Difference]: Start difference. First operand 349 states and 568 transitions. Second operand 5 states. [2019-10-13 21:29:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:12,192 INFO L93 Difference]: Finished difference Result 687 states and 1121 transitions. [2019-10-13 21:29:12,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:12,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-13 21:29:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:12,195 INFO L225 Difference]: With dead ends: 687 [2019-10-13 21:29:12,195 INFO L226 Difference]: Without dead ends: 351 [2019-10-13 21:29:12,196 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-13 21:29:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-13 21:29:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-13 21:29:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-13 21:29:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 566 transitions. [2019-10-13 21:29:12,213 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 566 transitions. Word has length 79 [2019-10-13 21:29:12,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:12,213 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 566 transitions. [2019-10-13 21:29:12,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 566 transitions. [2019-10-13 21:29:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 21:29:12,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:12,215 INFO L380 BasicCegarLoop]: trace histogram [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-13 21:29:12,216 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:12,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:12,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2051852968, now seen corresponding path program 1 times [2019-10-13 21:29:12,216 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:12,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20071631] [2019-10-13 21:29:12,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 21:29:12,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20071631] [2019-10-13 21:29:12,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:12,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:12,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277769249] [2019-10-13 21:29:12,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:12,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:12,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:12,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:12,270 INFO L87 Difference]: Start difference. First operand 349 states and 566 transitions. Second operand 5 states. [2019-10-13 21:29:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:12,469 INFO L93 Difference]: Finished difference Result 714 states and 1163 transitions. [2019-10-13 21:29:12,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:12,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-13 21:29:12,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:12,472 INFO L225 Difference]: With dead ends: 714 [2019-10-13 21:29:12,472 INFO L226 Difference]: Without dead ends: 378 [2019-10-13 21:29:12,473 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-13 21:29:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-13 21:29:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-10-13 21:29:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-13 21:29:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 601 transitions. [2019-10-13 21:29:12,490 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 601 transitions. Word has length 85 [2019-10-13 21:29:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:12,491 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 601 transitions. [2019-10-13 21:29:12,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 601 transitions. [2019-10-13 21:29:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-13 21:29:12,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:12,493 INFO L380 BasicCegarLoop]: trace histogram [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-13 21:29:12,493 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:12,493 INFO L82 PathProgramCache]: Analyzing trace with hash 406324048, now seen corresponding path program 1 times [2019-10-13 21:29:12,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:12,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413700199] [2019-10-13 21:29:12,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,559 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 21:29:12,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413700199] [2019-10-13 21:29:12,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:12,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:12,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521243170] [2019-10-13 21:29:12,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:12,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:12,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:12,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:12,562 INFO L87 Difference]: Start difference. First operand 373 states and 601 transitions. Second operand 5 states. [2019-10-13 21:29:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:12,780 INFO L93 Difference]: Finished difference Result 738 states and 1192 transitions. [2019-10-13 21:29:12,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:12,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-10-13 21:29:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:12,783 INFO L225 Difference]: With dead ends: 738 [2019-10-13 21:29:12,783 INFO L226 Difference]: Without dead ends: 378 [2019-10-13 21:29:12,785 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-13 21:29:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-13 21:29:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-10-13 21:29:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-13 21:29:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 595 transitions. [2019-10-13 21:29:12,807 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 595 transitions. Word has length 86 [2019-10-13 21:29:12,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:12,807 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 595 transitions. [2019-10-13 21:29:12,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 595 transitions. [2019-10-13 21:29:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 21:29:12,810 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:12,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:29:12,811 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:12,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2087471906, now seen corresponding path program 1 times [2019-10-13 21:29:12,812 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:12,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008502372] [2019-10-13 21:29:12,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 21:29:12,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008502372] [2019-10-13 21:29:12,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:12,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:12,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967116664] [2019-10-13 21:29:12,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:12,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:12,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:12,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:12,863 INFO L87 Difference]: Start difference. First operand 373 states and 595 transitions. Second operand 5 states. [2019-10-13 21:29:13,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:13,034 INFO L93 Difference]: Finished difference Result 742 states and 1185 transitions. [2019-10-13 21:29:13,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:13,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-13 21:29:13,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:13,037 INFO L225 Difference]: With dead ends: 742 [2019-10-13 21:29:13,037 INFO L226 Difference]: Without dead ends: 382 [2019-10-13 21:29:13,040 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-13 21:29:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-13 21:29:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-10-13 21:29:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-13 21:29:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 598 transitions. [2019-10-13 21:29:13,058 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 598 transitions. Word has length 91 [2019-10-13 21:29:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:13,059 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 598 transitions. [2019-10-13 21:29:13,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 598 transitions. [2019-10-13 21:29:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:29:13,061 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:13,061 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, 1, 1, 1, 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-13 21:29:13,061 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:13,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash 754738376, now seen corresponding path program 1 times [2019-10-13 21:29:13,062 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:13,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988672213] [2019-10-13 21:29:13,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:29:13,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988672213] [2019-10-13 21:29:13,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:13,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:13,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817378] [2019-10-13 21:29:13,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:13,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:13,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:13,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:13,113 INFO L87 Difference]: Start difference. First operand 382 states and 598 transitions. Second operand 5 states. [2019-10-13 21:29:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:13,327 INFO L93 Difference]: Finished difference Result 782 states and 1226 transitions. [2019-10-13 21:29:13,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:13,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-13 21:29:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:13,330 INFO L225 Difference]: With dead ends: 782 [2019-10-13 21:29:13,330 INFO L226 Difference]: Without dead ends: 413 [2019-10-13 21:29:13,332 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-13 21:29:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-10-13 21:29:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-10-13 21:29:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-13 21:29:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 639 transitions. [2019-10-13 21:29:13,355 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 639 transitions. Word has length 92 [2019-10-13 21:29:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:13,356 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 639 transitions. [2019-10-13 21:29:13,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 639 transitions. [2019-10-13 21:29:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 21:29:13,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:13,358 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, 1, 1, 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-13 21:29:13,358 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:13,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:13,359 INFO L82 PathProgramCache]: Analyzing trace with hash -196155072, now seen corresponding path program 1 times [2019-10-13 21:29:13,359 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:13,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956117217] [2019-10-13 21:29:13,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:29:13,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956117217] [2019-10-13 21:29:13,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:13,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:13,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270403577] [2019-10-13 21:29:13,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:13,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:13,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:13,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:13,423 INFO L87 Difference]: Start difference. First operand 411 states and 639 transitions. Second operand 5 states. [2019-10-13 21:29:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:13,781 INFO L93 Difference]: Finished difference Result 811 states and 1263 transitions. [2019-10-13 21:29:13,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:13,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-10-13 21:29:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:13,784 INFO L225 Difference]: With dead ends: 811 [2019-10-13 21:29:13,784 INFO L226 Difference]: Without dead ends: 413 [2019-10-13 21:29:13,786 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-13 21:29:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-10-13 21:29:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-10-13 21:29:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-13 21:29:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 635 transitions. [2019-10-13 21:29:13,805 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 635 transitions. Word has length 93 [2019-10-13 21:29:13,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:13,805 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 635 transitions. [2019-10-13 21:29:13,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:13,805 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 635 transitions. [2019-10-13 21:29:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:13,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:13,807 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-10-13 21:29:13,808 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash 222103604, now seen corresponding path program 1 times [2019-10-13 21:29:13,808 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:13,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963868471] [2019-10-13 21:29:13,809 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,809 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:29:13,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963868471] [2019-10-13 21:29:13,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:13,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:13,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724683020] [2019-10-13 21:29:13,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:13,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:13,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:13,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:13,889 INFO L87 Difference]: Start difference. First operand 411 states and 635 transitions. Second operand 5 states. [2019-10-13 21:29:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:14,100 INFO L93 Difference]: Finished difference Result 834 states and 1294 transitions. [2019-10-13 21:29:14,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:14,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 21:29:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:14,103 INFO L225 Difference]: With dead ends: 834 [2019-10-13 21:29:14,103 INFO L226 Difference]: Without dead ends: 436 [2019-10-13 21:29:14,104 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-13 21:29:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-13 21:29:14,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-10-13 21:29:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-10-13 21:29:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 662 transitions. [2019-10-13 21:29:14,123 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 662 transitions. Word has length 106 [2019-10-13 21:29:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:14,124 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 662 transitions. [2019-10-13 21:29:14,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 662 transitions. [2019-10-13 21:29:14,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 21:29:14,126 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:14,126 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-10-13 21:29:14,127 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:14,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:14,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1331192532, now seen corresponding path program 1 times [2019-10-13 21:29:14,127 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:14,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499446822] [2019-10-13 21:29:14,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:29:14,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499446822] [2019-10-13 21:29:14,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:14,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:14,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699361091] [2019-10-13 21:29:14,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:14,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:14,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:14,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:14,182 INFO L87 Difference]: Start difference. First operand 432 states and 662 transitions. Second operand 5 states. [2019-10-13 21:29:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:14,398 INFO L93 Difference]: Finished difference Result 855 states and 1313 transitions. [2019-10-13 21:29:14,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:14,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-13 21:29:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:14,401 INFO L225 Difference]: With dead ends: 855 [2019-10-13 21:29:14,402 INFO L226 Difference]: Without dead ends: 436 [2019-10-13 21:29:14,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-13 21:29:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-13 21:29:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-10-13 21:29:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-10-13 21:29:14,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 654 transitions. [2019-10-13 21:29:14,425 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 654 transitions. Word has length 107 [2019-10-13 21:29:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:14,426 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 654 transitions. [2019-10-13 21:29:14,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 654 transitions. [2019-10-13 21:29:14,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 21:29:14,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:14,428 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, 1, 1] [2019-10-13 21:29:14,429 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:14,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:14,429 INFO L82 PathProgramCache]: Analyzing trace with hash -276692460, now seen corresponding path program 1 times [2019-10-13 21:29:14,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:14,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298173431] [2019-10-13 21:29:14,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:29:14,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298173431] [2019-10-13 21:29:14,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:14,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:14,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607371841] [2019-10-13 21:29:14,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:14,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:14,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:14,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:14,489 INFO L87 Difference]: Start difference. First operand 432 states and 654 transitions. Second operand 5 states. [2019-10-13 21:29:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:14,735 INFO L93 Difference]: Finished difference Result 896 states and 1357 transitions. [2019-10-13 21:29:14,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:14,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-10-13 21:29:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:14,739 INFO L225 Difference]: With dead ends: 896 [2019-10-13 21:29:14,739 INFO L226 Difference]: Without dead ends: 477 [2019-10-13 21:29:14,740 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-13 21:29:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-13 21:29:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2019-10-13 21:29:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-13 21:29:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 715 transitions. [2019-10-13 21:29:14,766 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 715 transitions. Word has length 108 [2019-10-13 21:29:14,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:14,766 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 715 transitions. [2019-10-13 21:29:14,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 715 transitions. [2019-10-13 21:29:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 21:29:14,768 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:14,769 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] [2019-10-13 21:29:14,769 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:14,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:14,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1027622475, now seen corresponding path program 1 times [2019-10-13 21:29:14,770 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:14,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711157907] [2019-10-13 21:29:14,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:14,824 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-13 21:29:14,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711157907] [2019-10-13 21:29:14,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:14,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:14,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434202574] [2019-10-13 21:29:14,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:14,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:14,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:14,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:14,827 INFO L87 Difference]: Start difference. First operand 474 states and 715 transitions. Second operand 5 states. [2019-10-13 21:29:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:15,122 INFO L93 Difference]: Finished difference Result 971 states and 1465 transitions. [2019-10-13 21:29:15,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:15,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-13 21:29:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:15,127 INFO L225 Difference]: With dead ends: 971 [2019-10-13 21:29:15,127 INFO L226 Difference]: Without dead ends: 510 [2019-10-13 21:29:15,129 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-13 21:29:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-10-13 21:29:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2019-10-13 21:29:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-10-13 21:29:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 761 transitions. [2019-10-13 21:29:15,168 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 761 transitions. Word has length 109 [2019-10-13 21:29:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:15,169 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 761 transitions. [2019-10-13 21:29:15,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 761 transitions. [2019-10-13 21:29:15,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 21:29:15,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:15,174 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, 1, 1, 1] [2019-10-13 21:29:15,174 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:15,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1688696815, now seen corresponding path program 1 times [2019-10-13 21:29:15,175 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:15,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015745493] [2019-10-13 21:29:15,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:29:15,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015745493] [2019-10-13 21:29:15,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:15,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:15,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060924004] [2019-10-13 21:29:15,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:15,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:15,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:15,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:15,249 INFO L87 Difference]: Start difference. First operand 508 states and 761 transitions. Second operand 5 states. [2019-10-13 21:29:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:15,580 INFO L93 Difference]: Finished difference Result 1010 states and 1516 transitions. [2019-10-13 21:29:15,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:15,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-13 21:29:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:15,585 INFO L225 Difference]: With dead ends: 1010 [2019-10-13 21:29:15,585 INFO L226 Difference]: Without dead ends: 513 [2019-10-13 21:29:15,587 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-13 21:29:15,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-10-13 21:29:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2019-10-13 21:29:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-13 21:29:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 764 transitions. [2019-10-13 21:29:15,634 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 764 transitions. Word has length 109 [2019-10-13 21:29:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:15,635 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 764 transitions. [2019-10-13 21:29:15,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 764 transitions. [2019-10-13 21:29:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 21:29:15,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:15,639 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] [2019-10-13 21:29:15,639 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:15,640 INFO L82 PathProgramCache]: Analyzing trace with hash -429369896, now seen corresponding path program 1 times [2019-10-13 21:29:15,640 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:15,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974222886] [2019-10-13 21:29:15,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:15,744 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-13 21:29:15,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974222886] [2019-10-13 21:29:15,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:15,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:15,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681450537] [2019-10-13 21:29:15,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:15,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:15,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:15,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:15,746 INFO L87 Difference]: Start difference. First operand 510 states and 764 transitions. Second operand 5 states. [2019-10-13 21:29:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:15,963 INFO L93 Difference]: Finished difference Result 1009 states and 1513 transitions. [2019-10-13 21:29:15,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:15,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-13 21:29:15,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:15,967 INFO L225 Difference]: With dead ends: 1009 [2019-10-13 21:29:15,967 INFO L226 Difference]: Without dead ends: 512 [2019-10-13 21:29:15,968 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-13 21:29:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-10-13 21:29:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2019-10-13 21:29:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-13 21:29:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 760 transitions. [2019-10-13 21:29:15,991 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 760 transitions. Word has length 110 [2019-10-13 21:29:15,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:15,992 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 760 transitions. [2019-10-13 21:29:15,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 760 transitions. [2019-10-13 21:29:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:29:15,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:15,994 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:15,994 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:15,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:15,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1290144821, now seen corresponding path program 1 times [2019-10-13 21:29:15,995 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:15,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783030058] [2019-10-13 21:29:15,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-13 21:29:16,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783030058] [2019-10-13 21:29:16,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:16,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:16,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23578782] [2019-10-13 21:29:16,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:16,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:16,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:16,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:16,035 INFO L87 Difference]: Start difference. First operand 510 states and 760 transitions. Second operand 3 states. [2019-10-13 21:29:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:16,085 INFO L93 Difference]: Finished difference Result 1497 states and 2233 transitions. [2019-10-13 21:29:16,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:16,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-13 21:29:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:16,091 INFO L225 Difference]: With dead ends: 1497 [2019-10-13 21:29:16,091 INFO L226 Difference]: Without dead ends: 1000 [2019-10-13 21:29:16,093 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-13 21:29:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-10-13 21:29:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 511. [2019-10-13 21:29:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-10-13 21:29:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 761 transitions. [2019-10-13 21:29:16,124 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 761 transitions. Word has length 122 [2019-10-13 21:29:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:16,124 INFO L462 AbstractCegarLoop]: Abstraction has 511 states and 761 transitions. [2019-10-13 21:29:16,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 761 transitions. [2019-10-13 21:29:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:29:16,126 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:16,126 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:16,127 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:16,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:16,127 INFO L82 PathProgramCache]: Analyzing trace with hash -953838477, now seen corresponding path program 1 times [2019-10-13 21:29:16,127 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:16,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308319885] [2019-10-13 21:29:16,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-13 21:29:16,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308319885] [2019-10-13 21:29:16,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:16,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:16,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585611067] [2019-10-13 21:29:16,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:16,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:16,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:16,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:16,187 INFO L87 Difference]: Start difference. First operand 511 states and 761 transitions. Second operand 3 states. [2019-10-13 21:29:16,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:16,312 INFO L93 Difference]: Finished difference Result 1505 states and 2248 transitions. [2019-10-13 21:29:16,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:16,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-13 21:29:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:16,320 INFO L225 Difference]: With dead ends: 1505 [2019-10-13 21:29:16,321 INFO L226 Difference]: Without dead ends: 1007 [2019-10-13 21:29:16,323 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-13 21:29:16,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-10-13 21:29:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2019-10-13 21:29:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-10-13 21:29:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1498 transitions. [2019-10-13 21:29:16,400 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1498 transitions. Word has length 122 [2019-10-13 21:29:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:16,400 INFO L462 AbstractCegarLoop]: Abstraction has 1007 states and 1498 transitions. [2019-10-13 21:29:16,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1498 transitions. [2019-10-13 21:29:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-13 21:29:16,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:16,406 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:16,406 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:16,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:16,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1636886403, now seen corresponding path program 1 times [2019-10-13 21:29:16,407 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:16,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067578215] [2019-10-13 21:29:16,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-13 21:29:16,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067578215] [2019-10-13 21:29:16,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:16,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:16,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492741186] [2019-10-13 21:29:16,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:16,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:16,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:16,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:16,538 INFO L87 Difference]: Start difference. First operand 1007 states and 1498 transitions. Second operand 3 states. [2019-10-13 21:29:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:16,699 INFO L93 Difference]: Finished difference Result 2499 states and 3723 transitions. [2019-10-13 21:29:16,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:16,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-10-13 21:29:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:16,710 INFO L225 Difference]: With dead ends: 2499 [2019-10-13 21:29:16,711 INFO L226 Difference]: Without dead ends: 1505 [2019-10-13 21:29:16,714 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-13 21:29:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-10-13 21:29:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1503. [2019-10-13 21:29:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-10-13 21:29:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2239 transitions. [2019-10-13 21:29:16,825 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2239 transitions. Word has length 124 [2019-10-13 21:29:16,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:16,826 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 2239 transitions. [2019-10-13 21:29:16,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2239 transitions. [2019-10-13 21:29:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 21:29:16,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:16,832 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:16,832 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:16,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:16,833 INFO L82 PathProgramCache]: Analyzing trace with hash -89246318, now seen corresponding path program 1 times [2019-10-13 21:29:16,833 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:16,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690723716] [2019-10-13 21:29:16,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-13 21:29:16,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690723716] [2019-10-13 21:29:16,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:16,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:16,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974038292] [2019-10-13 21:29:16,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:16,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:16,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:16,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:16,898 INFO L87 Difference]: Start difference. First operand 1503 states and 2239 transitions. Second operand 3 states. [2019-10-13 21:29:17,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:17,090 INFO L93 Difference]: Finished difference Result 2003 states and 2984 transitions. [2019-10-13 21:29:17,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:17,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-13 21:29:17,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:17,105 INFO L225 Difference]: With dead ends: 2003 [2019-10-13 21:29:17,105 INFO L226 Difference]: Without dead ends: 2001 [2019-10-13 21:29:17,106 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-13 21:29:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-10-13 21:29:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1999. [2019-10-13 21:29:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2019-10-13 21:29:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2981 transitions. [2019-10-13 21:29:17,270 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2981 transitions. Word has length 125 [2019-10-13 21:29:17,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:17,271 INFO L462 AbstractCegarLoop]: Abstraction has 1999 states and 2981 transitions. [2019-10-13 21:29:17,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2981 transitions. [2019-10-13 21:29:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 21:29:17,278 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:17,279 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] [2019-10-13 21:29:17,279 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:17,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:17,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1672983707, now seen corresponding path program 1 times [2019-10-13 21:29:17,280 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:17,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277698968] [2019-10-13 21:29:17,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:17,281 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:17,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:17,394 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-13 21:29:17,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277698968] [2019-10-13 21:29:17,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:17,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:17,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807615366] [2019-10-13 21:29:17,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:17,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:17,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:17,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:17,398 INFO L87 Difference]: Start difference. First operand 1999 states and 2981 transitions. Second operand 5 states. [2019-10-13 21:29:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:17,869 INFO L93 Difference]: Finished difference Result 4173 states and 6206 transitions. [2019-10-13 21:29:17,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:17,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-10-13 21:29:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:17,882 INFO L225 Difference]: With dead ends: 4173 [2019-10-13 21:29:17,883 INFO L226 Difference]: Without dead ends: 2187 [2019-10-13 21:29:17,888 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-13 21:29:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2019-10-13 21:29:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2163. [2019-10-13 21:29:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2163 states. [2019-10-13 21:29:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3201 transitions. [2019-10-13 21:29:18,009 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3201 transitions. Word has length 155 [2019-10-13 21:29:18,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:18,010 INFO L462 AbstractCegarLoop]: Abstraction has 2163 states and 3201 transitions. [2019-10-13 21:29:18,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3201 transitions. [2019-10-13 21:29:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:29:18,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:18,015 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] [2019-10-13 21:29:18,016 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:18,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:18,016 INFO L82 PathProgramCache]: Analyzing trace with hash -132146072, now seen corresponding path program 1 times [2019-10-13 21:29:18,016 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:18,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651200471] [2019-10-13 21:29:18,017 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:18,017 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:18,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:18,087 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-13 21:29:18,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651200471] [2019-10-13 21:29:18,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:18,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:18,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914452385] [2019-10-13 21:29:18,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:18,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:18,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:18,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:18,090 INFO L87 Difference]: Start difference. First operand 2163 states and 3201 transitions. Second operand 5 states. [2019-10-13 21:29:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:18,396 INFO L93 Difference]: Finished difference Result 4337 states and 6418 transitions. [2019-10-13 21:29:18,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:18,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-13 21:29:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:18,408 INFO L225 Difference]: With dead ends: 4337 [2019-10-13 21:29:18,408 INFO L226 Difference]: Without dead ends: 2155 [2019-10-13 21:29:18,413 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-13 21:29:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2019-10-13 21:29:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2131. [2019-10-13 21:29:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-10-13 21:29:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 3145 transitions. [2019-10-13 21:29:18,524 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 3145 transitions. Word has length 156 [2019-10-13 21:29:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:18,525 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 3145 transitions. [2019-10-13 21:29:18,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 3145 transitions. [2019-10-13 21:29:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-13 21:29:18,530 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:18,530 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] [2019-10-13 21:29:18,531 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:18,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:18,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1669045776, now seen corresponding path program 1 times [2019-10-13 21:29:18,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:18,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477560228] [2019-10-13 21:29:18,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:18,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:18,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:18,648 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-13 21:29:18,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477560228] [2019-10-13 21:29:18,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330488614] [2019-10-13 21:29:18,649 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-13 21:29:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:18,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:18,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:29:18,881 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:29:18,968 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:18,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-13 21:29:18,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023879159] [2019-10-13 21:29:18,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:18,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:18,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:18,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:18,971 INFO L87 Difference]: Start difference. First operand 2131 states and 3145 transitions. Second operand 3 states. [2019-10-13 21:29:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:19,192 INFO L93 Difference]: Finished difference Result 4780 states and 7056 transitions. [2019-10-13 21:29:19,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:19,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-13 21:29:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:19,210 INFO L225 Difference]: With dead ends: 4780 [2019-10-13 21:29:19,210 INFO L226 Difference]: Without dead ends: 2662 [2019-10-13 21:29:19,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-10-13 21:29:19,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2660. [2019-10-13 21:29:19,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-10-13 21:29:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3906 transitions. [2019-10-13 21:29:19,430 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3906 transitions. Word has length 188 [2019-10-13 21:29:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:19,431 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 3906 transitions. [2019-10-13 21:29:19,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3906 transitions. [2019-10-13 21:29:19,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-13 21:29:19,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:19,440 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:19,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:19,655 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:19,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:19,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1467791988, now seen corresponding path program 1 times [2019-10-13 21:29:19,656 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:19,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118807313] [2019-10-13 21:29:19,656 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:29:19,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118807313] [2019-10-13 21:29:19,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:19,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:19,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48963152] [2019-10-13 21:29:19,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:19,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:19,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:19,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:19,793 INFO L87 Difference]: Start difference. First operand 2660 states and 3906 transitions. Second operand 3 states. [2019-10-13 21:29:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:19,989 INFO L93 Difference]: Finished difference Result 4249 states and 6242 transitions. [2019-10-13 21:29:19,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:19,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-13 21:29:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:20,012 INFO L225 Difference]: With dead ends: 4249 [2019-10-13 21:29:20,012 INFO L226 Difference]: Without dead ends: 3189 [2019-10-13 21:29:20,018 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-13 21:29:20,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2019-10-13 21:29:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3189. [2019-10-13 21:29:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-10-13 21:29:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4686 transitions. [2019-10-13 21:29:20,298 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4686 transitions. Word has length 192 [2019-10-13 21:29:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:20,299 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4686 transitions. [2019-10-13 21:29:20,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4686 transitions. [2019-10-13 21:29:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-13 21:29:20,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:20,317 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:20,317 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:20,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1040739973, now seen corresponding path program 1 times [2019-10-13 21:29:20,318 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:20,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189797163] [2019-10-13 21:29:20,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:20,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:20,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-10-13 21:29:20,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189797163] [2019-10-13 21:29:20,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:20,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:20,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42536158] [2019-10-13 21:29:20,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:20,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:20,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:20,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:20,484 INFO L87 Difference]: Start difference. First operand 3189 states and 4686 transitions. Second operand 3 states. [2019-10-13 21:29:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:21,033 INFO L93 Difference]: Finished difference Result 6425 states and 9427 transitions. [2019-10-13 21:29:21,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:21,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-10-13 21:29:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:21,063 INFO L225 Difference]: With dead ends: 6425 [2019-10-13 21:29:21,063 INFO L226 Difference]: Without dead ends: 3249 [2019-10-13 21:29:21,080 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-13 21:29:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-10-13 21:29:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3189. [2019-10-13 21:29:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-10-13 21:29:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4638 transitions. [2019-10-13 21:29:21,365 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4638 transitions. Word has length 270 [2019-10-13 21:29:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:21,366 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4638 transitions. [2019-10-13 21:29:21,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4638 transitions. [2019-10-13 21:29:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-13 21:29:21,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:21,383 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:21,386 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:21,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1618154303, now seen corresponding path program 1 times [2019-10-13 21:29:21,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:21,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461789051] [2019-10-13 21:29:21,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:21,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:21,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-13 21:29:21,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461789051] [2019-10-13 21:29:21,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:21,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:21,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744378856] [2019-10-13 21:29:21,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:21,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:21,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:21,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:21,512 INFO L87 Difference]: Start difference. First operand 3189 states and 4638 transitions. Second operand 3 states. [2019-10-13 21:29:21,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:21,874 INFO L93 Difference]: Finished difference Result 6461 states and 9373 transitions. [2019-10-13 21:29:21,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:21,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-13 21:29:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:21,886 INFO L225 Difference]: With dead ends: 6461 [2019-10-13 21:29:21,886 INFO L226 Difference]: Without dead ends: 3285 [2019-10-13 21:29:21,894 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-13 21:29:21,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-10-13 21:29:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 3189. [2019-10-13 21:29:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-10-13 21:29:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4422 transitions. [2019-10-13 21:29:22,168 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4422 transitions. Word has length 274 [2019-10-13 21:29:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:22,169 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4422 transitions. [2019-10-13 21:29:22,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4422 transitions. [2019-10-13 21:29:22,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-13 21:29:22,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:22,179 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:22,180 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:22,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1393049634, now seen corresponding path program 1 times [2019-10-13 21:29:22,180 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:22,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466006158] [2019-10-13 21:29:22,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:22,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:22,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-10-13 21:29:22,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466006158] [2019-10-13 21:29:22,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:22,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:22,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409157946] [2019-10-13 21:29:22,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:22,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:22,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:22,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:22,299 INFO L87 Difference]: Start difference. First operand 3189 states and 4422 transitions. Second operand 3 states. [2019-10-13 21:29:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:22,623 INFO L93 Difference]: Finished difference Result 6469 states and 8954 transitions. [2019-10-13 21:29:22,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:22,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-10-13 21:29:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:22,633 INFO L225 Difference]: With dead ends: 6469 [2019-10-13 21:29:22,633 INFO L226 Difference]: Without dead ends: 3293 [2019-10-13 21:29:22,640 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-13 21:29:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2019-10-13 21:29:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3195. [2019-10-13 21:29:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2019-10-13 21:29:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 4275 transitions. [2019-10-13 21:29:22,883 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 4275 transitions. Word has length 284 [2019-10-13 21:29:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:22,883 INFO L462 AbstractCegarLoop]: Abstraction has 3195 states and 4275 transitions. [2019-10-13 21:29:22,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 4275 transitions. [2019-10-13 21:29:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-13 21:29:22,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:22,901 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 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] [2019-10-13 21:29:22,902 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:22,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:22,902 INFO L82 PathProgramCache]: Analyzing trace with hash -27112689, now seen corresponding path program 1 times [2019-10-13 21:29:22,903 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:22,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554825359] [2019-10-13 21:29:22,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:22,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:22,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-13 21:29:23,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554825359] [2019-10-13 21:29:23,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299291790] [2019-10-13 21:29:23,137 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-13 21:29:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:23,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:23,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-10-13 21:29:23,431 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-10-13 21:29:23,525 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:23,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-13 21:29:23,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704283490] [2019-10-13 21:29:23,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:23,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:23,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:23,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:23,527 INFO L87 Difference]: Start difference. First operand 3195 states and 4275 transitions. Second operand 3 states. [2019-10-13 21:29:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:23,847 INFO L93 Difference]: Finished difference Result 9385 states and 12539 transitions. [2019-10-13 21:29:23,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:23,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-10-13 21:29:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:23,866 INFO L225 Difference]: With dead ends: 9385 [2019-10-13 21:29:23,867 INFO L226 Difference]: Without dead ends: 6209 [2019-10-13 21:29:23,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 588 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-13 21:29:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2019-10-13 21:29:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 6207. [2019-10-13 21:29:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2019-10-13 21:29:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 8271 transitions. [2019-10-13 21:29:24,252 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 8271 transitions. Word has length 294 [2019-10-13 21:29:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:24,252 INFO L462 AbstractCegarLoop]: Abstraction has 6207 states and 8271 transitions. [2019-10-13 21:29:24,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 8271 transitions. [2019-10-13 21:29:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-13 21:29:24,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:24,270 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 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] [2019-10-13 21:29:24,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:24,482 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:24,483 INFO L82 PathProgramCache]: Analyzing trace with hash 533587089, now seen corresponding path program 1 times [2019-10-13 21:29:24,484 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:24,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868872677] [2019-10-13 21:29:24,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-13 21:29:24,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868872677] [2019-10-13 21:29:24,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521702992] [2019-10-13 21:29:24,620 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-13 21:29:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:24,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:24,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-13 21:29:24,815 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-13 21:29:24,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [485988290] [2019-10-13 21:29:24,992 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 295 [2019-10-13 21:29:25,084 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:29:25,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:29:25,411 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:29:26,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:29:26,848 INFO L272 AbstractInterpreter]: Visited 98 different actions 1582 times. Merged at 85 different actions 1331 times. Widened at 16 different actions 180 times. Performed 3684 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3684 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 136 fixpoints after 18 different actions. Largest state had 97 variables. [2019-10-13 21:29:26,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:26,857 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:29:26,858 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:29:26,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-13 21:29:26,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037424879] [2019-10-13 21:29:26,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:26,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:26,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:26,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:26,861 INFO L87 Difference]: Start difference. First operand 6207 states and 8271 transitions. Second operand 6 states. [2019-10-13 21:29:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:28,154 INFO L93 Difference]: Finished difference Result 19340 states and 25403 transitions. [2019-10-13 21:29:28,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:29:28,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 294 [2019-10-13 21:29:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:28,181 INFO L225 Difference]: With dead ends: 19340 [2019-10-13 21:29:28,181 INFO L226 Difference]: Without dead ends: 12968 [2019-10-13 21:29:28,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:29:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12968 states. [2019-10-13 21:29:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12968 to 6197. [2019-10-13 21:29:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2019-10-13 21:29:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 8207 transitions. [2019-10-13 21:29:28,545 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 8207 transitions. Word has length 294 [2019-10-13 21:29:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:28,546 INFO L462 AbstractCegarLoop]: Abstraction has 6197 states and 8207 transitions. [2019-10-13 21:29:28,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 8207 transitions. [2019-10-13 21:29:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-13 21:29:28,561 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:28,561 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-13 21:29:28,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:28,768 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:28,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:28,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1588759982, now seen corresponding path program 1 times [2019-10-13 21:29:28,770 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:28,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165711525] [2019-10-13 21:29:28,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:28,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:28,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:28,867 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-10-13 21:29:28,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165711525] [2019-10-13 21:29:28,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:28,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:28,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056879599] [2019-10-13 21:29:28,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:28,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:28,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:28,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:28,870 INFO L87 Difference]: Start difference. First operand 6197 states and 8207 transitions. Second operand 3 states. [2019-10-13 21:29:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:29,430 INFO L93 Difference]: Finished difference Result 12761 states and 16914 transitions. [2019-10-13 21:29:29,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:29,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-10-13 21:29:29,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:29,445 INFO L225 Difference]: With dead ends: 12761 [2019-10-13 21:29:29,446 INFO L226 Difference]: Without dead ends: 6387 [2019-10-13 21:29:29,456 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-13 21:29:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6387 states. [2019-10-13 21:29:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6387 to 6377. [2019-10-13 21:29:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6377 states. [2019-10-13 21:29:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6377 states to 6377 states and 8381 transitions. [2019-10-13 21:29:29,737 INFO L78 Accepts]: Start accepts. Automaton has 6377 states and 8381 transitions. Word has length 312 [2019-10-13 21:29:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:29,738 INFO L462 AbstractCegarLoop]: Abstraction has 6377 states and 8381 transitions. [2019-10-13 21:29:29,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 6377 states and 8381 transitions. [2019-10-13 21:29:29,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-13 21:29:29,753 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:29,753 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-13 21:29:29,753 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:29,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:29,754 INFO L82 PathProgramCache]: Analyzing trace with hash -630627056, now seen corresponding path program 1 times [2019-10-13 21:29:29,754 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:29,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219550438] [2019-10-13 21:29:29,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:29,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:29,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-13 21:29:29,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219550438] [2019-10-13 21:29:29,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77793261] [2019-10-13 21:29:29,859 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-13 21:29:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:29,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:29,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-13 21:29:30,029 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-13 21:29:30,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [875651284] [2019-10-13 21:29:30,300 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 325 [2019-10-13 21:29:30,319 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:29:30,320 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:29:31,225 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:29:31,226 INFO L272 AbstractInterpreter]: Visited 80 different actions 1238 times. Merged at 69 different actions 1026 times. Widened at 12 different actions 104 times. Performed 2935 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2935 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 128 fixpoints after 14 different actions. Largest state had 95 variables. [2019-10-13 21:29:31,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:31,226 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:29:31,227 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:29:31,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-13 21:29:31,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323415588] [2019-10-13 21:29:31,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:31,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:31,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:31,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:31,229 INFO L87 Difference]: Start difference. First operand 6377 states and 8381 transitions. Second operand 6 states. [2019-10-13 21:29:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:32,575 INFO L93 Difference]: Finished difference Result 16309 states and 21142 transitions. [2019-10-13 21:29:32,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:29:32,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2019-10-13 21:29:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:32,598 INFO L225 Difference]: With dead ends: 16309 [2019-10-13 21:29:32,599 INFO L226 Difference]: Without dead ends: 9971 [2019-10-13 21:29:32,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:29:32,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9971 states. [2019-10-13 21:29:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9971 to 4565. [2019-10-13 21:29:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-10-13 21:29:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 5767 transitions. [2019-10-13 21:29:32,950 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 5767 transitions. Word has length 324 [2019-10-13 21:29:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:32,951 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 5767 transitions. [2019-10-13 21:29:32,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 5767 transitions. [2019-10-13 21:29:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-10-13 21:29:32,962 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:32,963 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-10-13 21:29:33,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:33,172 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:33,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:33,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1793866143, now seen corresponding path program 1 times [2019-10-13 21:29:33,173 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:33,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119168953] [2019-10-13 21:29:33,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:33,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:33,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-13 21:29:33,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119168953] [2019-10-13 21:29:33,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:33,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:33,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824550966] [2019-10-13 21:29:33,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:33,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:33,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:33,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:33,279 INFO L87 Difference]: Start difference. First operand 4565 states and 5767 transitions. Second operand 3 states. [2019-10-13 21:29:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:33,591 INFO L93 Difference]: Finished difference Result 9113 states and 11506 transitions. [2019-10-13 21:29:33,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:33,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-10-13 21:29:33,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:33,600 INFO L225 Difference]: With dead ends: 9113 [2019-10-13 21:29:33,600 INFO L226 Difference]: Without dead ends: 4587 [2019-10-13 21:29:33,606 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-13 21:29:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4587 states. [2019-10-13 21:29:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4587 to 4565. [2019-10-13 21:29:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-10-13 21:29:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 5701 transitions. [2019-10-13 21:29:33,799 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 5701 transitions. Word has length 327 [2019-10-13 21:29:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:33,800 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 5701 transitions. [2019-10-13 21:29:33,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 5701 transitions. [2019-10-13 21:29:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-10-13 21:29:33,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:33,808 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:29:33,809 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:33,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:33,809 INFO L82 PathProgramCache]: Analyzing trace with hash 141772578, now seen corresponding path program 1 times [2019-10-13 21:29:33,809 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:33,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099966848] [2019-10-13 21:29:33,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:33,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:33,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-13 21:29:33,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099966848] [2019-10-13 21:29:33,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:33,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:33,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264961438] [2019-10-13 21:29:33,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:33,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:33,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:33,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:33,930 INFO L87 Difference]: Start difference. First operand 4565 states and 5701 transitions. Second operand 3 states. [2019-10-13 21:29:34,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:34,387 INFO L93 Difference]: Finished difference Result 8025 states and 10084 transitions. [2019-10-13 21:29:34,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:34,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-10-13 21:29:34,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:34,396 INFO L225 Difference]: With dead ends: 8025 [2019-10-13 21:29:34,396 INFO L226 Difference]: Without dead ends: 4621 [2019-10-13 21:29:34,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-13 21:29:34,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4621 states. [2019-10-13 21:29:34,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4621 to 4565. [2019-10-13 21:29:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-10-13 21:29:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 5695 transitions. [2019-10-13 21:29:34,688 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 5695 transitions. Word has length 370 [2019-10-13 21:29:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:34,688 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 5695 transitions. [2019-10-13 21:29:34,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 5695 transitions. [2019-10-13 21:29:34,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-13 21:29:34,698 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:34,699 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:34,699 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:34,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:34,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1004200358, now seen corresponding path program 1 times [2019-10-13 21:29:34,700 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:34,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001242522] [2019-10-13 21:29:34,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:34,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:34,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-13 21:29:34,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001242522] [2019-10-13 21:29:34,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:34,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:34,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843856436] [2019-10-13 21:29:34,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:34,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:34,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:34,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:34,837 INFO L87 Difference]: Start difference. First operand 4565 states and 5695 transitions. Second operand 3 states. [2019-10-13 21:29:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:35,150 INFO L93 Difference]: Finished difference Result 8484 states and 10602 transitions. [2019-10-13 21:29:35,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:35,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-10-13 21:29:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:35,158 INFO L225 Difference]: With dead ends: 8484 [2019-10-13 21:29:35,158 INFO L226 Difference]: Without dead ends: 3837 [2019-10-13 21:29:35,169 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-13 21:29:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2019-10-13 21:29:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 3786. [2019-10-13 21:29:35,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3786 states. [2019-10-13 21:29:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 4711 transitions. [2019-10-13 21:29:35,347 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 4711 transitions. Word has length 393 [2019-10-13 21:29:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:35,348 INFO L462 AbstractCegarLoop]: Abstraction has 3786 states and 4711 transitions. [2019-10-13 21:29:35,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 4711 transitions. [2019-10-13 21:29:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-13 21:29:35,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:35,354 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:29:35,354 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash 404718799, now seen corresponding path program 1 times [2019-10-13 21:29:35,354 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:35,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496849564] [2019-10-13 21:29:35,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:35,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:35,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-10-13 21:29:35,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496849564] [2019-10-13 21:29:35,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:35,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:35,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2191207] [2019-10-13 21:29:35,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:35,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:35,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:35,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:35,508 INFO L87 Difference]: Start difference. First operand 3786 states and 4711 transitions. Second operand 3 states.