java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:29:05,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:29:05,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:29:05,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:29:05,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:29:05,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:29:05,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:29:05,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:29:05,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:29:05,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:29:05,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:29:05,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:29:05,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:29:05,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:29:05,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:29:05,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:29:05,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:29:05,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:29:05,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:29:05,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:29:05,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:29:05,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:29:05,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:29:05,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:29:05,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:29:05,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:29:05,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:29:05,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:29:05,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:29:05,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:29:05,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:29:05,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:29:05,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:29:05,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:29:05,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:29:05,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:29:05,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:29:05,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:29:05,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:29:05,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:29:05,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:29:05,117 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:05,151 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:29:05,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:29:05,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:29:05,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:29:05,157 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:29:05,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:29:05,158 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:29:05,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:29:05,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:29:05,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:29:05,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:29:05,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:29:05,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:29:05,159 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:29:05,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:29:05,159 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:29:05,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:29:05,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:29:05,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:29:05,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:29:05,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:29:05,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:29:05,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:29:05,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:29:05,161 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:29:05,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:29:05,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:29:05,162 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:29:05,162 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,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:29:05,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:29:05,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:29:05,457 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:29:05,457 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:29:05,458 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-10-13 21:29:05,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f457f1bc8/d5c8f1d9a1a8434ba8dd355cbd4b5f35/FLAGac316e6a2 [2019-10-13 21:29:06,055 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:29:06,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-10-13 21:29:06,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f457f1bc8/d5c8f1d9a1a8434ba8dd355cbd4b5f35/FLAGac316e6a2 [2019-10-13 21:29:06,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f457f1bc8/d5c8f1d9a1a8434ba8dd355cbd4b5f35 [2019-10-13 21:29:06,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:29:06,387 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:29:06,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:06,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:29:06,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:29:06,392 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,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1e49d4 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,396 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,403 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:29:06,455 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:29:06,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:06,742 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:29:06,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:06,920 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:29:06,921 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,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:06,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:29:06,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:29:06,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:29:06,935 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,935 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,945 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,945 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,958 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,973 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,976 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,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:29:06,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:29:06,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:29:06,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:29:06,985 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:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:29:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:29:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-13 21:29:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:29:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:29:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:29:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:29:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 21:29:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 21:29:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-13 21:29:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:29:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:29:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:29:07,337 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:29:07,869 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-13 21:29:07,870 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-13 21:29:07,878 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:29:07,878 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:29:07,880 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,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:29:07,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:29:07,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:29:07,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:29:07,888 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,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a7353c 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,890 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,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a7353c 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,891 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,903 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2019-10-13 21:29:07,912 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:29:07,921 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:29:07,932 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:29:07,959 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:29:07,960 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:29:07,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:29:07,960 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:29:07,960 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:29:07,960 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:29:07,961 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:29:07,961 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:29:07,984 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-10-13 21:29:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 21:29:07,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:07,995 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:07,997 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash -617772913, now seen corresponding path program 1 times [2019-10-13 21:29:08,010 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:08,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377297938] [2019-10-13 21:29:08,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:08,300 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,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377297938] [2019-10-13 21:29:08,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:08,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:08,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067469470] [2019-10-13 21:29:08,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:08,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:08,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:08,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:08,334 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2019-10-13 21:29:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:08,822 INFO L93 Difference]: Finished difference Result 348 states and 596 transitions. [2019-10-13 21:29:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:08,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-13 21:29:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:08,849 INFO L225 Difference]: With dead ends: 348 [2019-10-13 21:29:08,850 INFO L226 Difference]: Without dead ends: 185 [2019-10-13 21:29:08,859 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,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-13 21:29:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2019-10-13 21:29:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-13 21:29:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 284 transitions. [2019-10-13 21:29:08,922 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 284 transitions. Word has length 47 [2019-10-13 21:29:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:08,923 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 284 transitions. [2019-10-13 21:29:08,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 284 transitions. [2019-10-13 21:29:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 21:29:08,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:08,926 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:08,926 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:08,927 INFO L82 PathProgramCache]: Analyzing trace with hash 401544370, now seen corresponding path program 1 times [2019-10-13 21:29:08,927 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:08,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371013070] [2019-10-13 21:29:08,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:09,106 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,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371013070] [2019-10-13 21:29:09,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:09,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:09,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562933121] [2019-10-13 21:29:09,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:09,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:09,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:09,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:09,111 INFO L87 Difference]: Start difference. First operand 177 states and 284 transitions. Second operand 5 states. [2019-10-13 21:29:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,402 INFO L93 Difference]: Finished difference Result 388 states and 636 transitions. [2019-10-13 21:29:09,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:09,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-13 21:29:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,408 INFO L225 Difference]: With dead ends: 388 [2019-10-13 21:29:09,410 INFO L226 Difference]: Without dead ends: 224 [2019-10-13 21:29:09,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:09,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-13 21:29:09,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2019-10-13 21:29:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-13 21:29:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-13 21:29:09,458 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 48 [2019-10-13 21:29:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,458 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-13 21:29:09,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-13 21:29:09,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-13 21:29:09,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,467 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:09,470 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,471 INFO L82 PathProgramCache]: Analyzing trace with hash 353705226, now seen corresponding path program 1 times [2019-10-13 21:29:09,471 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604237333] [2019-10-13 21:29:09,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:09,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604237333] [2019-10-13 21:29:09,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:09,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:09,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752987613] [2019-10-13 21:29:09,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:09,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:09,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:09,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:09,605 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-13 21:29:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,868 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-13 21:29:09,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:09,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-13 21:29:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,871 INFO L225 Difference]: With dead ends: 450 [2019-10-13 21:29:09,871 INFO L226 Difference]: Without dead ends: 247 [2019-10-13 21:29:09,872 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,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-13 21:29:09,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-13 21:29:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-13 21:29:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-13 21:29:09,901 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 75 [2019-10-13 21:29:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,902 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-13 21:29:09,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:09,904 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-13 21:29:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-13 21:29:09,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,911 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:09,916 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,917 INFO L82 PathProgramCache]: Analyzing trace with hash -668843297, 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,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783242546] [2019-10-13 21:29:09,917 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,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,035 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:10,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783242546] [2019-10-13 21:29:10,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:10,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941603041] [2019-10-13 21:29:10,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:10,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:10,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:10,038 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-13 21:29:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,302 INFO L93 Difference]: Finished difference Result 519 states and 878 transitions. [2019-10-13 21:29:10,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:10,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-10-13 21:29:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,305 INFO L225 Difference]: With dead ends: 519 [2019-10-13 21:29:10,306 INFO L226 Difference]: Without dead ends: 285 [2019-10-13 21:29:10,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-13 21:29:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-10-13 21:29:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-13 21:29:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 478 transitions. [2019-10-13 21:29:10,326 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 478 transitions. Word has length 80 [2019-10-13 21:29:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,327 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 478 transitions. [2019-10-13 21:29:10,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 478 transitions. [2019-10-13 21:29:10,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-13 21:29:10,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,330 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,330 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,331 INFO L82 PathProgramCache]: Analyzing trace with hash 293568124, now seen corresponding path program 1 times [2019-10-13 21:29:10,331 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595982704] [2019-10-13 21:29:10,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,430 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:10,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595982704] [2019-10-13 21:29:10,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:10,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220500779] [2019-10-13 21:29:10,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:10,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:10,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:10,434 INFO L87 Difference]: Start difference. First operand 283 states and 478 transitions. Second operand 5 states. [2019-10-13 21:29:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,709 INFO L93 Difference]: Finished difference Result 555 states and 941 transitions. [2019-10-13 21:29:10,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:10,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-10-13 21:29:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,712 INFO L225 Difference]: With dead ends: 555 [2019-10-13 21:29:10,713 INFO L226 Difference]: Without dead ends: 285 [2019-10-13 21:29:10,714 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,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-13 21:29:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-10-13 21:29:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-13 21:29:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 476 transitions. [2019-10-13 21:29:10,728 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 476 transitions. Word has length 81 [2019-10-13 21:29:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,729 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 476 transitions. [2019-10-13 21:29:10,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 476 transitions. [2019-10-13 21:29:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 21:29:10,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,731 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,731 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,732 INFO L82 PathProgramCache]: Analyzing trace with hash -95009440, now seen corresponding path program 1 times [2019-10-13 21:29:10,732 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435934213] [2019-10-13 21:29:10,733 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,733 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:10,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435934213] [2019-10-13 21:29:10,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:10,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139595963] [2019-10-13 21:29:10,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:10,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:10,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:10,824 INFO L87 Difference]: Start difference. First operand 283 states and 476 transitions. Second operand 5 states. [2019-10-13 21:29:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,031 INFO L93 Difference]: Finished difference Result 570 states and 963 transitions. [2019-10-13 21:29:11,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:11,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-10-13 21:29:11,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,033 INFO L225 Difference]: With dead ends: 570 [2019-10-13 21:29:11,034 INFO L226 Difference]: Without dead ends: 300 [2019-10-13 21:29:11,035 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,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-13 21:29:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-13 21:29:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-13 21:29:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-10-13 21:29:11,049 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 87 [2019-10-13 21:29:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,049 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-10-13 21:29:11,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-10-13 21:29:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:29:11,051 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,052 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:11,052 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1081604216, now seen corresponding path program 1 times [2019-10-13 21:29:11,053 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123012732] [2019-10-13 21:29:11,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:11,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123012732] [2019-10-13 21:29:11,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:11,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:11,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717930029] [2019-10-13 21:29:11,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:11,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:11,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:11,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:11,110 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 5 states. [2019-10-13 21:29:11,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,314 INFO L93 Difference]: Finished difference Result 585 states and 981 transitions. [2019-10-13 21:29:11,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:11,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-10-13 21:29:11,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,317 INFO L225 Difference]: With dead ends: 585 [2019-10-13 21:29:11,317 INFO L226 Difference]: Without dead ends: 300 [2019-10-13 21:29:11,319 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,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-13 21:29:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-13 21:29:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-13 21:29:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 494 transitions. [2019-10-13 21:29:11,336 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 494 transitions. Word has length 88 [2019-10-13 21:29:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,336 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 494 transitions. [2019-10-13 21:29:11,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 494 transitions. [2019-10-13 21:29:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:29:11,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,339 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:11,339 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2001210697, now seen corresponding path program 1 times [2019-10-13 21:29:11,340 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344196668] [2019-10-13 21:29:11,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-13 21:29:11,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344196668] [2019-10-13 21:29:11,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:11,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:11,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541454952] [2019-10-13 21:29:11,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:11,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:11,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:11,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:11,401 INFO L87 Difference]: Start difference. First operand 298 states and 494 transitions. Second operand 5 states. [2019-10-13 21:29:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,583 INFO L93 Difference]: Finished difference Result 592 states and 983 transitions. [2019-10-13 21:29:11,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:11,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-13 21:29:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,585 INFO L225 Difference]: With dead ends: 592 [2019-10-13 21:29:11,586 INFO L226 Difference]: Without dead ends: 307 [2019-10-13 21:29:11,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:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-13 21:29:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-10-13 21:29:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-13 21:29:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 500 transitions. [2019-10-13 21:29:11,601 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 500 transitions. Word has length 100 [2019-10-13 21:29:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,602 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 500 transitions. [2019-10-13 21:29:11,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 500 transitions. [2019-10-13 21:29:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:29:11,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,604 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:11,604 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1192129085, now seen corresponding path program 1 times [2019-10-13 21:29:11,605 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479276734] [2019-10-13 21:29:11,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:11,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479276734] [2019-10-13 21:29:11,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:11,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:11,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811887003] [2019-10-13 21:29:11,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:11,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:11,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:11,672 INFO L87 Difference]: Start difference. First operand 307 states and 500 transitions. Second operand 5 states. [2019-10-13 21:29:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,908 INFO L93 Difference]: Finished difference Result 632 states and 1036 transitions. [2019-10-13 21:29:11,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:11,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-10-13 21:29:11,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,911 INFO L225 Difference]: With dead ends: 632 [2019-10-13 21:29:11,911 INFO L226 Difference]: Without dead ends: 338 [2019-10-13 21:29:11,913 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,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-13 21:29:11,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-13 21:29:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-13 21:29:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-10-13 21:29:11,935 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 101 [2019-10-13 21:29:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,937 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-10-13 21:29:11,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-10-13 21:29:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 21:29:11,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,940 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:11,940 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,941 INFO L82 PathProgramCache]: Analyzing trace with hash 775386699, now seen corresponding path program 1 times [2019-10-13 21:29:11,941 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768673253] [2019-10-13 21:29:11,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:12,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768673253] [2019-10-13 21:29:12,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:12,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:12,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745636319] [2019-10-13 21:29:12,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:12,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:12,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:12,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:12,046 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 5 states. [2019-10-13 21:29:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:12,258 INFO L93 Difference]: Finished difference Result 661 states and 1079 transitions. [2019-10-13 21:29:12,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:12,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 21:29:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:12,261 INFO L225 Difference]: With dead ends: 661 [2019-10-13 21:29:12,261 INFO L226 Difference]: Without dead ends: 338 [2019-10-13 21:29:12,262 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,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-13 21:29:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-13 21:29:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-13 21:29:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 543 transitions. [2019-10-13 21:29:12,279 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 543 transitions. Word has length 102 [2019-10-13 21:29:12,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:12,279 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 543 transitions. [2019-10-13 21:29:12,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 543 transitions. [2019-10-13 21:29:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 21:29:12,281 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:12,282 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:12,282 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:12,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:12,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1217428909, now seen corresponding path program 1 times [2019-10-13 21:29:12,283 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:12,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914641594] [2019-10-13 21:29:12,283 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,283 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:12,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914641594] [2019-10-13 21:29:12,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:12,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:12,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117986196] [2019-10-13 21:29:12,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:12,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:12,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:12,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:12,345 INFO L87 Difference]: Start difference. First operand 336 states and 543 transitions. Second operand 5 states. [2019-10-13 21:29:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:12,549 INFO L93 Difference]: Finished difference Result 694 states and 1129 transitions. [2019-10-13 21:29:12,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:12,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-13 21:29:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:12,552 INFO L225 Difference]: With dead ends: 694 [2019-10-13 21:29:12,552 INFO L226 Difference]: Without dead ends: 371 [2019-10-13 21:29:12,553 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,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-13 21:29:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-13 21:29:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-13 21:29:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 585 transitions. [2019-10-13 21:29:12,571 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 585 transitions. Word has length 103 [2019-10-13 21:29:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:12,571 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 585 transitions. [2019-10-13 21:29:12,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 585 transitions. [2019-10-13 21:29:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:29:12,573 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:12,573 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:12,574 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:12,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:12,574 INFO L82 PathProgramCache]: Analyzing trace with hash -141729733, now seen corresponding path program 1 times [2019-10-13 21:29:12,574 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:12,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517648743] [2019-10-13 21:29:12,575 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,575 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:12,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517648743] [2019-10-13 21:29:12,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:12,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:12,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689248738] [2019-10-13 21:29:12,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:12,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:12,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:12,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:12,630 INFO L87 Difference]: Start difference. First operand 363 states and 585 transitions. Second operand 5 states. [2019-10-13 21:29:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:12,832 INFO L93 Difference]: Finished difference Result 721 states and 1166 transitions. [2019-10-13 21:29:12,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:12,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-13 21:29:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:12,834 INFO L225 Difference]: With dead ends: 721 [2019-10-13 21:29:12,835 INFO L226 Difference]: Without dead ends: 371 [2019-10-13 21:29:12,836 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,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-13 21:29:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-13 21:29:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-13 21:29:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 580 transitions. [2019-10-13 21:29:12,851 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 580 transitions. Word has length 104 [2019-10-13 21:29:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:12,852 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 580 transitions. [2019-10-13 21:29:12,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 580 transitions. [2019-10-13 21:29:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:29:12,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:12,854 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:12,854 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:12,855 INFO L82 PathProgramCache]: Analyzing trace with hash -564771468, now seen corresponding path program 1 times [2019-10-13 21:29:12,855 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:12,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661118200] [2019-10-13 21:29:12,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:12,957 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:12,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661118200] [2019-10-13 21:29:12,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:12,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:12,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446646740] [2019-10-13 21:29:12,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:12,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:12,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:12,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:12,959 INFO L87 Difference]: Start difference. First operand 363 states and 580 transitions. Second operand 5 states. [2019-10-13 21:29:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:13,187 INFO L93 Difference]: Finished difference Result 749 states and 1201 transitions. [2019-10-13 21:29:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:13,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-13 21:29:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:13,191 INFO L225 Difference]: With dead ends: 749 [2019-10-13 21:29:13,191 INFO L226 Difference]: Without dead ends: 399 [2019-10-13 21:29:13,192 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,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-13 21:29:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-10-13 21:29:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-13 21:29:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 633 transitions. [2019-10-13 21:29:13,210 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 633 transitions. Word has length 111 [2019-10-13 21:29:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:13,211 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 633 transitions. [2019-10-13 21:29:13,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 633 transitions. [2019-10-13 21:29:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:29:13,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:13,213 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:13,213 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:13,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:13,214 INFO L82 PathProgramCache]: Analyzing trace with hash -285750569, now seen corresponding path program 1 times [2019-10-13 21:29:13,214 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:13,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252861503] [2019-10-13 21:29:13,215 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,215 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:13,269 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:13,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252861503] [2019-10-13 21:29:13,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:13,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:13,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937026818] [2019-10-13 21:29:13,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:13,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:13,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:13,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:13,271 INFO L87 Difference]: Start difference. First operand 397 states and 633 transitions. Second operand 5 states. [2019-10-13 21:29:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:13,496 INFO L93 Difference]: Finished difference Result 783 states and 1251 transitions. [2019-10-13 21:29:13,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:13,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-13 21:29:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:13,499 INFO L225 Difference]: With dead ends: 783 [2019-10-13 21:29:13,499 INFO L226 Difference]: Without dead ends: 399 [2019-10-13 21:29:13,501 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,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-13 21:29:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-10-13 21:29:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-13 21:29:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 630 transitions. [2019-10-13 21:29:13,536 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 630 transitions. Word has length 112 [2019-10-13 21:29:13,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:13,536 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 630 transitions. [2019-10-13 21:29:13,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 630 transitions. [2019-10-13 21:29:13,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:29:13,538 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:13,539 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:13,539 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:13,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:13,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1187170139, now seen corresponding path program 1 times [2019-10-13 21:29:13,540 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:13,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371464074] [2019-10-13 21:29:13,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:13,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371464074] [2019-10-13 21:29:13,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:13,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:13,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038433979] [2019-10-13 21:29:13,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:13,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:13,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:13,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:13,598 INFO L87 Difference]: Start difference. First operand 397 states and 630 transitions. Second operand 5 states. [2019-10-13 21:29:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:13,865 INFO L93 Difference]: Finished difference Result 828 states and 1317 transitions. [2019-10-13 21:29:13,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:13,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-10-13 21:29:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:13,869 INFO L225 Difference]: With dead ends: 828 [2019-10-13 21:29:13,869 INFO L226 Difference]: Without dead ends: 444 [2019-10-13 21:29:13,872 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,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-10-13 21:29:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 439. [2019-10-13 21:29:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-13 21:29:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 695 transitions. [2019-10-13 21:29:13,904 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 695 transitions. Word has length 117 [2019-10-13 21:29:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:13,904 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 695 transitions. [2019-10-13 21:29:13,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 695 transitions. [2019-10-13 21:29:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 21:29:13,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:13,907 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:13,908 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:13,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:13,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1861118978, now seen corresponding path program 1 times [2019-10-13 21:29:13,909 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:13,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941723498] [2019-10-13 21:29:13,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,910 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:13,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941723498] [2019-10-13 21:29:13,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:13,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:13,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937253110] [2019-10-13 21:29:14,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:14,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:14,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:14,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:14,002 INFO L87 Difference]: Start difference. First operand 439 states and 695 transitions. Second operand 5 states. [2019-10-13 21:29:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:14,284 INFO L93 Difference]: Finished difference Result 874 states and 1388 transitions. [2019-10-13 21:29:14,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:14,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-10-13 21:29:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:14,287 INFO L225 Difference]: With dead ends: 874 [2019-10-13 21:29:14,287 INFO L226 Difference]: Without dead ends: 446 [2019-10-13 21:29:14,288 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,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-13 21:29:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 441. [2019-10-13 21:29:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-13 21:29:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 698 transitions. [2019-10-13 21:29:14,310 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 698 transitions. Word has length 118 [2019-10-13 21:29:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:14,310 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 698 transitions. [2019-10-13 21:29:14,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 698 transitions. [2019-10-13 21:29:14,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 21:29:14,313 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:14,314 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:14,314 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:14,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:14,315 INFO L82 PathProgramCache]: Analyzing trace with hash 385795336, now seen corresponding path program 1 times [2019-10-13 21:29:14,315 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:14,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558594633] [2019-10-13 21:29:14,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-13 21:29:14,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558594633] [2019-10-13 21:29:14,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:14,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:14,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395203823] [2019-10-13 21:29:14,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:14,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:14,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:14,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:14,392 INFO L87 Difference]: Start difference. First operand 441 states and 698 transitions. Second operand 5 states. [2019-10-13 21:29:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:14,605 INFO L93 Difference]: Finished difference Result 907 states and 1443 transitions. [2019-10-13 21:29:14,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:14,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-10-13 21:29:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:14,609 INFO L225 Difference]: With dead ends: 907 [2019-10-13 21:29:14,609 INFO L226 Difference]: Without dead ends: 479 [2019-10-13 21:29:14,611 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,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-13 21:29:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-10-13 21:29:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-13 21:29:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 733 transitions. [2019-10-13 21:29:14,637 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 733 transitions. Word has length 129 [2019-10-13 21:29:14,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:14,637 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 733 transitions. [2019-10-13 21:29:14,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:14,637 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 733 transitions. [2019-10-13 21:29:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:29:14,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:14,640 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:14,640 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:14,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:14,641 INFO L82 PathProgramCache]: Analyzing trace with hash -177817520, now seen corresponding path program 1 times [2019-10-13 21:29:14,641 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:14,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5885592] [2019-10-13 21:29:14,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-13 21:29:14,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5885592] [2019-10-13 21:29:14,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:14,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:14,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257556326] [2019-10-13 21:29:14,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:14,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:14,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:14,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:14,715 INFO L87 Difference]: Start difference. First operand 466 states and 733 transitions. Second operand 5 states. [2019-10-13 21:29:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:14,942 INFO L93 Difference]: Finished difference Result 932 states and 1470 transitions. [2019-10-13 21:29:14,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:14,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-13 21:29:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:14,946 INFO L225 Difference]: With dead ends: 932 [2019-10-13 21:29:14,946 INFO L226 Difference]: Without dead ends: 479 [2019-10-13 21:29:14,947 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,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-13 21:29:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-10-13 21:29:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-13 21:29:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 725 transitions. [2019-10-13 21:29:14,970 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 725 transitions. Word has length 130 [2019-10-13 21:29:14,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:14,971 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 725 transitions. [2019-10-13 21:29:14,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:14,971 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 725 transitions. [2019-10-13 21:29:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:29:14,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:14,973 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:14,973 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:14,974 INFO L82 PathProgramCache]: Analyzing trace with hash 755280415, now seen corresponding path program 1 times [2019-10-13 21:29:14,974 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:14,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468016304] [2019-10-13 21:29:14,974 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:15,030 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-13 21:29:15,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468016304] [2019-10-13 21:29:15,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:15,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:15,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434558866] [2019-10-13 21:29:15,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:15,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:15,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:15,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:15,033 INFO L87 Difference]: Start difference. First operand 466 states and 725 transitions. Second operand 5 states. [2019-10-13 21:29:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:15,289 INFO L93 Difference]: Finished difference Result 923 states and 1438 transitions. [2019-10-13 21:29:15,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:15,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-13 21:29:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:15,292 INFO L225 Difference]: With dead ends: 923 [2019-10-13 21:29:15,292 INFO L226 Difference]: Without dead ends: 470 [2019-10-13 21:29:15,293 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,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-13 21:29:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-10-13 21:29:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-13 21:29:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 720 transitions. [2019-10-13 21:29:15,316 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 720 transitions. Word has length 142 [2019-10-13 21:29:15,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:15,316 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 720 transitions. [2019-10-13 21:29:15,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 720 transitions. [2019-10-13 21:29:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:29:15,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:15,319 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:15,319 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:15,320 INFO L82 PathProgramCache]: Analyzing trace with hash -816490564, now seen corresponding path program 1 times [2019-10-13 21:29:15,320 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:15,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181720894] [2019-10-13 21:29:15,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-13 21:29:15,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181720894] [2019-10-13 21:29:15,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:15,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:15,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461848485] [2019-10-13 21:29:15,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:15,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:15,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:15,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:15,395 INFO L87 Difference]: Start difference. First operand 466 states and 720 transitions. Second operand 5 states. [2019-10-13 21:29:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:15,619 INFO L93 Difference]: Finished difference Result 923 states and 1428 transitions. [2019-10-13 21:29:15,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:15,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-13 21:29:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:15,623 INFO L225 Difference]: With dead ends: 923 [2019-10-13 21:29:15,624 INFO L226 Difference]: Without dead ends: 470 [2019-10-13 21:29:15,625 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,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-13 21:29:15,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-10-13 21:29:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-13 21:29:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 715 transitions. [2019-10-13 21:29:15,649 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 715 transitions. Word has length 143 [2019-10-13 21:29:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:15,649 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 715 transitions. [2019-10-13 21:29:15,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 715 transitions. [2019-10-13 21:29:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:29:15,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:15,652 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:15,652 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:15,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:15,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1136592958, now seen corresponding path program 1 times [2019-10-13 21:29:15,653 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:15,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939958872] [2019-10-13 21:29:15,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-13 21:29:15,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939958872] [2019-10-13 21:29:15,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:15,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:15,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448962129] [2019-10-13 21:29:15,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:15,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:15,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:15,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:15,760 INFO L87 Difference]: Start difference. First operand 466 states and 715 transitions. Second operand 5 states. [2019-10-13 21:29:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:16,039 INFO L93 Difference]: Finished difference Result 947 states and 1458 transitions. [2019-10-13 21:29:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:16,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:29:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:16,044 INFO L225 Difference]: With dead ends: 947 [2019-10-13 21:29:16,044 INFO L226 Difference]: Without dead ends: 494 [2019-10-13 21:29:16,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-13 21:29:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-10-13 21:29:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-13 21:29:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 746 transitions. [2019-10-13 21:29:16,088 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 746 transitions. Word has length 150 [2019-10-13 21:29:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:16,088 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 746 transitions. [2019-10-13 21:29:16,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 746 transitions. [2019-10-13 21:29:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:29:16,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:16,092 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:16,092 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:16,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:16,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1424495078, now seen corresponding path program 1 times [2019-10-13 21:29:16,093 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:16,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822512767] [2019-10-13 21:29:16,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-13 21:29:16,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822512767] [2019-10-13 21:29:16,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:16,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:16,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035101566] [2019-10-13 21:29:16,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:16,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:16,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:16,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:16,231 INFO L87 Difference]: Start difference. First operand 490 states and 746 transitions. Second operand 5 states. [2019-10-13 21:29:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:16,453 INFO L93 Difference]: Finished difference Result 971 states and 1480 transitions. [2019-10-13 21:29:16,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:16,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-13 21:29:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:16,459 INFO L225 Difference]: With dead ends: 971 [2019-10-13 21:29:16,459 INFO L226 Difference]: Without dead ends: 494 [2019-10-13 21:29:16,461 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:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-13 21:29:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-10-13 21:29:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-13 21:29:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 737 transitions. [2019-10-13 21:29:16,491 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 737 transitions. Word has length 151 [2019-10-13 21:29:16,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:16,491 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 737 transitions. [2019-10-13 21:29:16,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 737 transitions. [2019-10-13 21:29:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:29:16,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:16,495 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:16,495 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:16,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:16,495 INFO L82 PathProgramCache]: Analyzing trace with hash 311984194, now seen corresponding path program 1 times [2019-10-13 21:29:16,495 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:16,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472624386] [2019-10-13 21:29:16,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:16,579 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:16,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472624386] [2019-10-13 21:29:16,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:16,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:16,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621345700] [2019-10-13 21:29:16,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:16,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:16,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:16,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:16,583 INFO L87 Difference]: Start difference. First operand 490 states and 737 transitions. Second operand 5 states. [2019-10-13 21:29:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:16,803 INFO L93 Difference]: Finished difference Result 1014 states and 1523 transitions. [2019-10-13 21:29:16,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:16,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-13 21:29:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:16,806 INFO L225 Difference]: With dead ends: 1014 [2019-10-13 21:29:16,806 INFO L226 Difference]: Without dead ends: 537 [2019-10-13 21:29:16,808 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:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-13 21:29:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2019-10-13 21:29:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-10-13 21:29:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 792 transitions. [2019-10-13 21:29:16,832 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 792 transitions. Word has length 157 [2019-10-13 21:29:16,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:16,833 INFO L462 AbstractCegarLoop]: Abstraction has 531 states and 792 transitions. [2019-10-13 21:29:16,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 792 transitions. [2019-10-13 21:29:16,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:29:16,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:16,835 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:16,836 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:16,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:16,836 INFO L82 PathProgramCache]: Analyzing trace with hash -611548539, now seen corresponding path program 1 times [2019-10-13 21:29:16,837 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:16,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424777706] [2019-10-13 21:29:16,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:16,909 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:16,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424777706] [2019-10-13 21:29:16,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:16,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:16,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13242202] [2019-10-13 21:29:16,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:16,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:16,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:16,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:16,912 INFO L87 Difference]: Start difference. First operand 531 states and 792 transitions. Second operand 5 states. [2019-10-13 21:29:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:17,208 INFO L93 Difference]: Finished difference Result 1055 states and 1576 transitions. [2019-10-13 21:29:17,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:17,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-13 21:29:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:17,212 INFO L225 Difference]: With dead ends: 1055 [2019-10-13 21:29:17,213 INFO L226 Difference]: Without dead ends: 518 [2019-10-13 21:29:17,220 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,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-10-13 21:29:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-10-13 21:29:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-13 21:29:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 762 transitions. [2019-10-13 21:29:17,299 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 762 transitions. Word has length 158 [2019-10-13 21:29:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:17,299 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 762 transitions. [2019-10-13 21:29:17,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 762 transitions. [2019-10-13 21:29:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 21:29:17,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:17,302 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:17,303 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:17,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1831676618, now seen corresponding path program 1 times [2019-10-13 21:29:17,305 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:17,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949743153] [2019-10-13 21:29:17,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:17,306 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:17,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-13 21:29:17,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949743153] [2019-10-13 21:29:17,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:17,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:17,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156095224] [2019-10-13 21:29:17,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:17,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:17,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:17,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:17,413 INFO L87 Difference]: Start difference. First operand 512 states and 762 transitions. Second operand 5 states. [2019-10-13 21:29:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:17,668 INFO L93 Difference]: Finished difference Result 1036 states and 1548 transitions. [2019-10-13 21:29:17,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:17,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-10-13 21:29:17,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:17,672 INFO L225 Difference]: With dead ends: 1036 [2019-10-13 21:29:17,672 INFO L226 Difference]: Without dead ends: 537 [2019-10-13 21:29:17,674 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,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-13 21:29:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2019-10-13 21:29:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-13 21:29:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 786 transitions. [2019-10-13 21:29:17,699 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 786 transitions. Word has length 171 [2019-10-13 21:29:17,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:17,700 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 786 transitions. [2019-10-13 21:29:17,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 786 transitions. [2019-10-13 21:29:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-13 21:29:17,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:17,702 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:17,703 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:17,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:17,703 INFO L82 PathProgramCache]: Analyzing trace with hash -813103810, now seen corresponding path program 1 times [2019-10-13 21:29:17,703 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:17,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996796931] [2019-10-13 21:29:17,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:17,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:17,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-13 21:29:17,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996796931] [2019-10-13 21:29:17,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:17,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:17,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243272173] [2019-10-13 21:29:17,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:17,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:17,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:17,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:17,778 INFO L87 Difference]: Start difference. First operand 533 states and 786 transitions. Second operand 5 states. [2019-10-13 21:29:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:17,989 INFO L93 Difference]: Finished difference Result 1057 states and 1561 transitions. [2019-10-13 21:29:17,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:17,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-10-13 21:29:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:17,993 INFO L225 Difference]: With dead ends: 1057 [2019-10-13 21:29:17,993 INFO L226 Difference]: Without dead ends: 535 [2019-10-13 21:29:17,995 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,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-10-13 21:29:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2019-10-13 21:29:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-10-13 21:29:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 772 transitions. [2019-10-13 21:29:18,020 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 772 transitions. Word has length 172 [2019-10-13 21:29:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:18,021 INFO L462 AbstractCegarLoop]: Abstraction has 531 states and 772 transitions. [2019-10-13 21:29:18,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 772 transitions. [2019-10-13 21:29:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-13 21:29:18,023 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:18,024 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:18,024 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:18,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:18,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1628821973, now seen corresponding path program 1 times [2019-10-13 21:29:18,024 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:18,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670986209] [2019-10-13 21:29:18,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:18,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:18,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:18,119 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,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670986209] [2019-10-13 21:29:18,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767087295] [2019-10-13 21:29:18,120 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,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:18,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:18,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-13 21:29:18,421 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-13 21:29:18,527 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:18,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-13 21:29:18,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758527374] [2019-10-13 21:29:18,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:18,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:18,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:18,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:18,530 INFO L87 Difference]: Start difference. First operand 531 states and 772 transitions. Second operand 4 states. [2019-10-13 21:29:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:18,780 INFO L93 Difference]: Finished difference Result 2081 states and 3035 transitions. [2019-10-13 21:29:18,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:18,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-10-13 21:29:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:18,789 INFO L225 Difference]: With dead ends: 2081 [2019-10-13 21:29:18,789 INFO L226 Difference]: Without dead ends: 1563 [2019-10-13 21:29:18,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-10-13 21:29:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2019-10-13 21:29:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-10-13 21:29:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2271 transitions. [2019-10-13 21:29:18,901 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2271 transitions. Word has length 187 [2019-10-13 21:29:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:18,902 INFO L462 AbstractCegarLoop]: Abstraction has 1563 states and 2271 transitions. [2019-10-13 21:29:18,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2271 transitions. [2019-10-13 21:29:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-13 21:29:18,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:18,906 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:19,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:19,114 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:19,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:19,114 INFO L82 PathProgramCache]: Analyzing trace with hash -304112884, now seen corresponding path program 1 times [2019-10-13 21:29:19,115 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:19,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599759420] [2019-10-13 21:29:19,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-13 21:29:19,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599759420] [2019-10-13 21:29:19,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:19,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:19,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423637914] [2019-10-13 21:29:19,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:19,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:19,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:19,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:19,242 INFO L87 Difference]: Start difference. First operand 1563 states and 2271 transitions. Second operand 3 states. [2019-10-13 21:29:19,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:19,442 INFO L93 Difference]: Finished difference Result 3624 states and 5270 transitions. [2019-10-13 21:29:19,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:19,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-13 21:29:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:19,452 INFO L225 Difference]: With dead ends: 3624 [2019-10-13 21:29:19,452 INFO L226 Difference]: Without dead ends: 2074 [2019-10-13 21:29:19,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:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2019-10-13 21:29:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2019-10-13 21:29:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-10-13 21:29:19,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3008 transitions. [2019-10-13 21:29:19,578 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3008 transitions. Word has length 196 [2019-10-13 21:29:19,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:19,578 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 3008 transitions. [2019-10-13 21:29:19,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3008 transitions. [2019-10-13 21:29:19,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-13 21:29:19,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:19,586 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:19,586 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:19,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:19,587 INFO L82 PathProgramCache]: Analyzing trace with hash 779902296, now seen corresponding path program 1 times [2019-10-13 21:29:19,587 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:19,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937374080] [2019-10-13 21:29:19,587 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 468 proven. 26 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:29:19,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937374080] [2019-10-13 21:29:19,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241166151] [2019-10-13 21:29:19,705 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:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:19,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:19,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-10-13 21:29:19,970 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-10-13 21:29:20,035 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:20,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-13 21:29:20,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543079671] [2019-10-13 21:29:20,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:20,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:20,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:20,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:20,039 INFO L87 Difference]: Start difference. First operand 2074 states and 3008 transitions. Second operand 4 states. [2019-10-13 21:29:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:20,297 INFO L93 Difference]: Finished difference Result 5167 states and 7505 transitions. [2019-10-13 21:29:20,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:20,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-10-13 21:29:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:20,318 INFO L225 Difference]: With dead ends: 5167 [2019-10-13 21:29:20,318 INFO L226 Difference]: Without dead ends: 3106 [2019-10-13 21:29:20,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2019-10-13 21:29:20,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3106. [2019-10-13 21:29:20,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3106 states. [2019-10-13 21:29:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 4508 transitions. [2019-10-13 21:29:20,587 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 4508 transitions. Word has length 266 [2019-10-13 21:29:20,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:20,588 INFO L462 AbstractCegarLoop]: Abstraction has 3106 states and 4508 transitions. [2019-10-13 21:29:20,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 4508 transitions. [2019-10-13 21:29:20,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-10-13 21:29:20,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:20,607 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:20,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:20,814 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:20,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:20,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1979389122, now seen corresponding path program 1 times [2019-10-13 21:29:20,815 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:20,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926025812] [2019-10-13 21:29:20,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:20,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:20,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-10-13 21:29:21,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926025812] [2019-10-13 21:29:21,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:21,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:21,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807012964] [2019-10-13 21:29:21,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:21,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:21,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:21,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:21,215 INFO L87 Difference]: Start difference. First operand 3106 states and 4508 transitions. Second operand 3 states. [2019-10-13 21:29:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:21,585 INFO L93 Difference]: Finished difference Result 8796 states and 12757 transitions. [2019-10-13 21:29:21,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:21,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2019-10-13 21:29:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:21,616 INFO L225 Difference]: With dead ends: 8796 [2019-10-13 21:29:21,616 INFO L226 Difference]: Without dead ends: 5703 [2019-10-13 21:29:21,628 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,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2019-10-13 21:29:22,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5701. [2019-10-13 21:29:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5701 states. [2019-10-13 21:29:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 8249 transitions. [2019-10-13 21:29:22,036 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 8249 transitions. Word has length 346 [2019-10-13 21:29:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:22,036 INFO L462 AbstractCegarLoop]: Abstraction has 5701 states and 8249 transitions. [2019-10-13 21:29:22,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 8249 transitions. [2019-10-13 21:29:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-10-13 21:29:22,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:22,052 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:22,052 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:22,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:22,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1101052781, now seen corresponding path program 1 times [2019-10-13 21:29:22,057 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:22,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685651220] [2019-10-13 21:29:22,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:22,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:22,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-10-13 21:29:22,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685651220] [2019-10-13 21:29:22,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:22,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:29:22,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662186776] [2019-10-13 21:29:22,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:22,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:22,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:22,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:22,210 INFO L87 Difference]: Start difference. First operand 5701 states and 8249 transitions. Second operand 3 states. [2019-10-13 21:29:22,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:22,734 INFO L93 Difference]: Finished difference Result 11629 states and 16865 transitions. [2019-10-13 21:29:22,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:22,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2019-10-13 21:29:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:22,776 INFO L225 Difference]: With dead ends: 11629 [2019-10-13 21:29:22,777 INFO L226 Difference]: Without dead ends: 4505 [2019-10-13 21:29:22,794 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,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2019-10-13 21:29:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 4465. [2019-10-13 21:29:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4465 states. [2019-10-13 21:29:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 6358 transitions. [2019-10-13 21:29:23,139 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 6358 transitions. Word has length 383 [2019-10-13 21:29:23,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:23,140 INFO L462 AbstractCegarLoop]: Abstraction has 4465 states and 6358 transitions. [2019-10-13 21:29:23,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:23,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 6358 transitions. [2019-10-13 21:29:23,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-10-13 21:29:23,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:23,157 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:23,157 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:23,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:23,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1869824397, now seen corresponding path program 1 times [2019-10-13 21:29:23,158 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:23,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797342527] [2019-10-13 21:29:23,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:23,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:23,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-13 21:29:23,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797342527] [2019-10-13 21:29:23,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871855333] [2019-10-13 21:29:23,367 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:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:23,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:23,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-10-13 21:29:23,713 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-10-13 21:29:23,929 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:23,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-13 21:29:23,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735558275] [2019-10-13 21:29:23,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:23,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:23,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:23,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:23,932 INFO L87 Difference]: Start difference. First operand 4465 states and 6358 transitions. Second operand 3 states. [2019-10-13 21:29:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:24,051 INFO L93 Difference]: Finished difference Result 4525 states and 6444 transitions. [2019-10-13 21:29:24,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:24,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 449 [2019-10-13 21:29:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:24,080 INFO L225 Difference]: With dead ends: 4525 [2019-10-13 21:29:24,080 INFO L226 Difference]: Without dead ends: 3146 [2019-10-13 21:29:24,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2019-10-13 21:29:24,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 3088. [2019-10-13 21:29:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3088 states. [2019-10-13 21:29:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 4395 transitions. [2019-10-13 21:29:24,292 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 4395 transitions. Word has length 449 [2019-10-13 21:29:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:24,293 INFO L462 AbstractCegarLoop]: Abstraction has 3088 states and 4395 transitions. [2019-10-13 21:29:24,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 4395 transitions. [2019-10-13 21:29:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-10-13 21:29:24,305 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:24,306 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:24,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:24,510 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash -915884239, now seen corresponding path program 1 times [2019-10-13 21:29:24,511 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:24,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625709940] [2019-10-13 21:29:24,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-13 21:29:24,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625709940] [2019-10-13 21:29:24,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626063084] [2019-10-13 21:29:24,709 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:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:24,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:24,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-10-13 21:29:25,197 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-10-13 21:29:25,405 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:25,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-13 21:29:25,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486714192] [2019-10-13 21:29:25,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:25,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:25,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:25,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:25,408 INFO L87 Difference]: Start difference. First operand 3088 states and 4395 transitions. Second operand 3 states. [2019-10-13 21:29:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:25,690 INFO L93 Difference]: Finished difference Result 6631 states and 9448 transitions. [2019-10-13 21:29:25,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:25,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 449 [2019-10-13 21:29:25,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:25,705 INFO L225 Difference]: With dead ends: 6631 [2019-10-13 21:29:25,706 INFO L226 Difference]: Without dead ends: 3556 [2019-10-13 21:29:25,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3556 states. [2019-10-13 21:29:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3556 to 3556. [2019-10-13 21:29:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3556 states. [2019-10-13 21:29:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 5062 transitions. [2019-10-13 21:29:26,080 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 5062 transitions. Word has length 449 [2019-10-13 21:29:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:26,081 INFO L462 AbstractCegarLoop]: Abstraction has 3556 states and 5062 transitions. [2019-10-13 21:29:26,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 5062 transitions. [2019-10-13 21:29:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-10-13 21:29:26,099 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:26,100 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:26,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:26,306 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:26,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:26,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1287293752, now seen corresponding path program 1 times [2019-10-13 21:29:26,306 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:26,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594336754] [2019-10-13 21:29:26,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:26,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:26,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 1629 proven. 26 refuted. 0 times theorem prover too weak. 1531 trivial. 0 not checked. [2019-10-13 21:29:26,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594336754] [2019-10-13 21:29:26,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569914055] [2019-10-13 21:29:26,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:26,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:26,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 1679 proven. 0 refuted. 0 times theorem prover too weak. 1507 trivial. 0 not checked. [2019-10-13 21:29:26,947 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 1679 proven. 0 refuted. 0 times theorem prover too weak. 1507 trivial. 0 not checked. [2019-10-13 21:29:27,078 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:27,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-13 21:29:27,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239739421] [2019-10-13 21:29:27,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:27,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:27,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:27,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:27,080 INFO L87 Difference]: Start difference. First operand 3556 states and 5062 transitions. Second operand 3 states. [2019-10-13 21:29:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:27,286 INFO L93 Difference]: Finished difference Result 7612 states and 10840 transitions. [2019-10-13 21:29:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:27,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 561 [2019-10-13 21:29:27,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:27,297 INFO L225 Difference]: With dead ends: 7612 [2019-10-13 21:29:27,297 INFO L226 Difference]: Without dead ends: 4069 [2019-10-13 21:29:27,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1125 GetRequests, 1121 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states. [2019-10-13 21:29:27,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 4069. [2019-10-13 21:29:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2019-10-13 21:29:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 5794 transitions. [2019-10-13 21:29:27,576 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 5794 transitions. Word has length 561 [2019-10-13 21:29:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:27,577 INFO L462 AbstractCegarLoop]: Abstraction has 4069 states and 5794 transitions. [2019-10-13 21:29:27,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 5794 transitions. [2019-10-13 21:29:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-10-13 21:29:27,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:27,600 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:27,807 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:27,807 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:27,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:27,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1109132628, now seen corresponding path program 1 times [2019-10-13 21:29:27,808 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:27,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637075174] [2019-10-13 21:29:27,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:27,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:27,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-13 21:29:28,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637075174] [2019-10-13 21:29:28,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230247793] [2019-10-13 21:29:28,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:28,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:28,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-13 21:29:28,659 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-13 21:29:28,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [467224728] [2019-10-13 21:29:28,916 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 601 [2019-10-13 21:29:28,995 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:29:28,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:29:29,341 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:29:31,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:29:31,162 INFO L272 AbstractInterpreter]: Visited 109 different actions 2392 times. Merged at 95 different actions 1937 times. Widened at 18 different actions 293 times. Performed 5536 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5536 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 319 fixpoints after 32 different actions. Largest state had 97 variables. [2019-10-13 21:29:31,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:31,170 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:29:31,171 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:29:31,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-13 21:29:31,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525473389] [2019-10-13 21:29:31,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:31,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:31,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:31,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:31,175 INFO L87 Difference]: Start difference. First operand 4069 states and 5794 transitions. Second operand 6 states. [2019-10-13 21:29:31,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:31,722 INFO L93 Difference]: Finished difference Result 8211 states and 11666 transitions. [2019-10-13 21:29:31,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:31,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 600 [2019-10-13 21:29:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:31,731 INFO L225 Difference]: With dead ends: 8211 [2019-10-13 21:29:31,732 INFO L226 Difference]: Without dead ends: 4067 [2019-10-13 21:29:31,741 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1207 GetRequests, 1201 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:29:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2019-10-13 21:29:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3780. [2019-10-13 21:29:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2019-10-13 21:29:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5132 transitions. [2019-10-13 21:29:31,898 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5132 transitions. Word has length 600 [2019-10-13 21:29:31,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:31,899 INFO L462 AbstractCegarLoop]: Abstraction has 3780 states and 5132 transitions. [2019-10-13 21:29:31,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5132 transitions. [2019-10-13 21:29:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1021 [2019-10-13 21:29:31,919 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:31,919 INFO L380 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:32,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:32,128 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:32,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:32,129 INFO L82 PathProgramCache]: Analyzing trace with hash 859855159, now seen corresponding path program 1 times [2019-10-13 21:29:32,130 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:32,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848265142] [2019-10-13 21:29:32,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:32,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:32,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-13 21:29:32,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848265142] [2019-10-13 21:29:32,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716536183] [2019-10-13 21:29:32,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:33,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:33,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-13 21:29:33,504 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-13 21:29:34,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [725201412] [2019-10-13 21:29:34,199 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 1021 [2019-10-13 21:29:34,206 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:29:34,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:29:34,285 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:29:35,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:29:35,666 INFO L272 AbstractInterpreter]: Visited 121 different actions 2696 times. Merged at 104 different actions 2127 times. Widened at 22 different actions 342 times. Performed 6485 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6485 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 401 fixpoints after 28 different actions. Largest state had 101 variables. [2019-10-13 21:29:35,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:35,666 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:29:35,667 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:29:35,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-13 21:29:35,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653855242] [2019-10-13 21:29:35,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:35,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:35,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:35,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:35,671 INFO L87 Difference]: Start difference. First operand 3780 states and 5132 transitions. Second operand 6 states. [2019-10-13 21:29:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:36,405 INFO L93 Difference]: Finished difference Result 11228 states and 15494 transitions. [2019-10-13 21:29:36,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:36,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1020 [2019-10-13 21:29:36,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:36,422 INFO L225 Difference]: With dead ends: 11228 [2019-10-13 21:29:36,422 INFO L226 Difference]: Without dead ends: 7183 [2019-10-13 21:29:36,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2049 GetRequests, 2042 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:29:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7183 states.