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 -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:50:47,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:50:47,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:50:47,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:50:47,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:50:47,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:50:47,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:50:47,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:50:47,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:50:47,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:50:47,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:50:47,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:50:47,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:50:47,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:50:47,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:50:47,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:50:47,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:50:47,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:50:47,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:50:47,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:50:47,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:50:47,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:50:47,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:50:47,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:50:47,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:50:47,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:50:47,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:50:47,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:50:47,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:50:47,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:50:47,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:50:47,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:50:47,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:50:47,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:50:47,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:50:47,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:50:47,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:50:47,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:50:47,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:50:47,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:50:47,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:50:47,270 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 19:50:47,304 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:50:47,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:50:47,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:50:47,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:50:47,310 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:50:47,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:50:47,311 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:50:47,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:50:47,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:50:47,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:50:47,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:50:47,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:50:47,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:50:47,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:50:47,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:50:47,312 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:50:47,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:50:47,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:50:47,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:50:47,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:50:47,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:50:47,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:47,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:50:47,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:50:47,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:50:47,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:50:47,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:50:47,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:50:47,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:50:47,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:50:47,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:50:47,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:50:47,631 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:50:47,632 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:50:47,632 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-10-13 19:50:47,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b984cc4a/983caf6221014dcfa81e9963b2e229aa/FLAG5b9d10d15 [2019-10-13 19:50:48,278 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:50:48,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-10-13 19:50:48,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b984cc4a/983caf6221014dcfa81e9963b2e229aa/FLAG5b9d10d15 [2019-10-13 19:50:48,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b984cc4a/983caf6221014dcfa81e9963b2e229aa [2019-10-13 19:50:48,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:50:48,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:50:48,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:48,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:50:48,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:50:48,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:48" (1/1) ... [2019-10-13 19:50:48,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a632ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:48, skipping insertion in model container [2019-10-13 19:50:48,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:48" (1/1) ... [2019-10-13 19:50:48,626 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:50:48,703 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:50:48,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:48,983 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:50:49,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:49,150 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:50:49,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49 WrapperNode [2019-10-13 19:50:49,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:49,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:50:49,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:50:49,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:50:49,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:50:49,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:50:49,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:50:49,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:50:49,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (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 19:50:49,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:50:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:50:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-13 19:50:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:50:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:50:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:50:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:50:49,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 19:50:49,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 19:50:49,298 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-13 19:50:49,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:50:49,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:50:49,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:50:49,573 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:50:50,094 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-13 19:50:50,095 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-13 19:50:50,098 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:50:50,098 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:50:50,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:50 BoogieIcfgContainer [2019-10-13 19:50:50,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:50:50,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:50:50,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:50:50,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:50:50,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:50:48" (1/3) ... [2019-10-13 19:50:50,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707b4e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:50, skipping insertion in model container [2019-10-13 19:50:50,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (2/3) ... [2019-10-13 19:50:50,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707b4e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:50, skipping insertion in model container [2019-10-13 19:50:50,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:50" (3/3) ... [2019-10-13 19:50:50,109 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-10-13 19:50:50,119 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:50:50,128 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:50:50,141 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:50:50,169 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:50:50,170 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:50:50,170 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:50:50,170 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:50:50,170 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:50:50,171 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:50:50,171 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:50:50,171 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:50:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-13 19:50:50,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 19:50:50,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:50,204 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:50,206 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:50,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:50,212 INFO L82 PathProgramCache]: Analyzing trace with hash 882212075, now seen corresponding path program 1 times [2019-10-13 19:50:50,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:50,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195070218] [2019-10-13 19:50:50,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:50,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:50,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:50,552 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 19:50:50,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195070218] [2019-10-13 19:50:50,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:50,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:50,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708868850] [2019-10-13 19:50:50,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:50,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:50,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:50,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:50,580 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-13 19:50:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:51,069 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-10-13 19:50:51,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:51,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-13 19:50:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:51,090 INFO L225 Difference]: With dead ends: 337 [2019-10-13 19:50:51,091 INFO L226 Difference]: Without dead ends: 180 [2019-10-13 19:50:51,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-13 19:50:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-13 19:50:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-13 19:50:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-13 19:50:51,163 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-13 19:50:51,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:51,164 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-13 19:50:51,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-13 19:50:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 19:50:51,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:51,167 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:51,168 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1571615886, now seen corresponding path program 1 times [2019-10-13 19:50:51,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:51,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597967267] [2019-10-13 19:50:51,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,355 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 19:50:51,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597967267] [2019-10-13 19:50:51,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:51,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:51,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424655554] [2019-10-13 19:50:51,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:51,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:51,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:51,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:51,361 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-13 19:50:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:51,702 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-10-13 19:50:51,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:51,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-13 19:50:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:51,706 INFO L225 Difference]: With dead ends: 385 [2019-10-13 19:50:51,711 INFO L226 Difference]: Without dead ends: 221 [2019-10-13 19:50:51,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:51,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-13 19:50:51,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-13 19:50:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-13 19:50:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-13 19:50:51,735 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-13 19:50:51,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:51,736 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-13 19:50:51,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-13 19:50:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 19:50:51,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:51,740 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:51,741 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:51,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1796709690, now seen corresponding path program 1 times [2019-10-13 19:50:51,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:51,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310748670] [2019-10-13 19:50:51,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,869 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 19:50:51,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310748670] [2019-10-13 19:50:51,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:51,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:51,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143581631] [2019-10-13 19:50:51,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:51,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:51,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:51,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:51,880 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-13 19:50:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:52,149 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-13 19:50:52,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:52,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-13 19:50:52,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:52,152 INFO L225 Difference]: With dead ends: 450 [2019-10-13 19:50:52,153 INFO L226 Difference]: Without dead ends: 247 [2019-10-13 19:50:52,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-13 19:50:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-13 19:50:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-13 19:50:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-13 19:50:52,186 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-13 19:50:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:52,187 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-13 19:50:52,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-13 19:50:52,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 19:50:52,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:52,196 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:52,196 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:52,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash 903111100, now seen corresponding path program 1 times [2019-10-13 19:50:52,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:52,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284061179] [2019-10-13 19:50:52,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,295 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 19:50:52,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284061179] [2019-10-13 19:50:52,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:52,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:52,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067716999] [2019-10-13 19:50:52,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:52,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:52,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:52,299 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-13 19:50:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:52,499 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-10-13 19:50:52,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:52,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-13 19:50:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:52,502 INFO L225 Difference]: With dead ends: 498 [2019-10-13 19:50:52,502 INFO L226 Difference]: Without dead ends: 264 [2019-10-13 19:50:52,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:52,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-13 19:50:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-13 19:50:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-13 19:50:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-13 19:50:52,519 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-13 19:50:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:52,519 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-13 19:50:52,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-13 19:50:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 19:50:52,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:52,522 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, 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 19:50:52,522 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:52,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:52,522 INFO L82 PathProgramCache]: Analyzing trace with hash -890466136, now seen corresponding path program 1 times [2019-10-13 19:50:52,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:52,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811458291] [2019-10-13 19:50:52,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:52,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811458291] [2019-10-13 19:50:52,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:52,633 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:52,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568176871] [2019-10-13 19:50:52,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:52,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:52,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:52,636 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-13 19:50:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:52,896 INFO L93 Difference]: Finished difference Result 557 states and 936 transitions. [2019-10-13 19:50:52,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:52,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-13 19:50:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:52,899 INFO L225 Difference]: With dead ends: 557 [2019-10-13 19:50:52,899 INFO L226 Difference]: Without dead ends: 308 [2019-10-13 19:50:52,901 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-13 19:50:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-10-13 19:50:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 19:50:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-13 19:50:52,916 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-13 19:50:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:52,916 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-13 19:50:52,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-13 19:50:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 19:50:52,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:52,919 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:52,919 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:52,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:52,919 INFO L82 PathProgramCache]: Analyzing trace with hash -550567068, now seen corresponding path program 1 times [2019-10-13 19:50:52,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:52,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809501176] [2019-10-13 19:50:52,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,004 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 19:50:53,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809501176] [2019-10-13 19:50:53,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:53,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210719599] [2019-10-13 19:50:53,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:53,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:53,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:53,007 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-13 19:50:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:53,192 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-10-13 19:50:53,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:53,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-13 19:50:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:53,195 INFO L225 Difference]: With dead ends: 597 [2019-10-13 19:50:53,195 INFO L226 Difference]: Without dead ends: 306 [2019-10-13 19:50:53,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-13 19:50:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-13 19:50:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 19:50:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-13 19:50:53,211 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-13 19:50:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:53,211 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-13 19:50:53,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-13 19:50:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 19:50:53,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:53,214 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, 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 19:50:53,214 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:53,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:53,214 INFO L82 PathProgramCache]: Analyzing trace with hash -80048661, now seen corresponding path program 1 times [2019-10-13 19:50:53,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:53,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063465195] [2019-10-13 19:50:53,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:53,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063465195] [2019-10-13 19:50:53,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:53,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304032130] [2019-10-13 19:50:53,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:53,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:53,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:53,301 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-13 19:50:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:53,581 INFO L93 Difference]: Finished difference Result 599 states and 1000 transitions. [2019-10-13 19:50:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:53,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-13 19:50:53,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:53,584 INFO L225 Difference]: With dead ends: 599 [2019-10-13 19:50:53,585 INFO L226 Difference]: Without dead ends: 306 [2019-10-13 19:50:53,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-13 19:50:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-10-13 19:50:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-13 19:50:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-13 19:50:53,601 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-13 19:50:53,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:53,602 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-13 19:50:53,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-13 19:50:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 19:50:53,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:53,604 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:53,604 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:53,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:53,605 INFO L82 PathProgramCache]: Analyzing trace with hash 597213445, now seen corresponding path program 1 times [2019-10-13 19:50:53,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:53,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577428396] [2019-10-13 19:50:53,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,674 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 19:50:53,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577428396] [2019-10-13 19:50:53,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:53,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29711017] [2019-10-13 19:50:53,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:53,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:53,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:53,677 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-13 19:50:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:53,889 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-13 19:50:53,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:53,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 19:50:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:53,891 INFO L225 Difference]: With dead ends: 600 [2019-10-13 19:50:53,891 INFO L226 Difference]: Without dead ends: 311 [2019-10-13 19:50:53,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-13 19:50:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-13 19:50:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-13 19:50:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-13 19:50:53,908 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-13 19:50:53,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:53,908 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-13 19:50:53,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-13 19:50:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 19:50:53,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:53,911 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:53,911 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:53,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:53,911 INFO L82 PathProgramCache]: Analyzing trace with hash 301165919, now seen corresponding path program 1 times [2019-10-13 19:50:53,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:53,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644650041] [2019-10-13 19:50:53,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,991 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 19:50:53,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644650041] [2019-10-13 19:50:53,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:53,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201472694] [2019-10-13 19:50:53,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:53,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:53,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:53,995 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-13 19:50:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,222 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-10-13 19:50:54,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-13 19:50:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,225 INFO L225 Difference]: With dead ends: 640 [2019-10-13 19:50:54,226 INFO L226 Difference]: Without dead ends: 342 [2019-10-13 19:50:54,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-13 19:50:54,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-13 19:50:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-13 19:50:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-13 19:50:54,246 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-13 19:50:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,248 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-13 19:50:54,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-13 19:50:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:50:54,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,254 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:54,255 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,255 INFO L82 PathProgramCache]: Analyzing trace with hash -283935385, now seen corresponding path program 1 times [2019-10-13 19:50:54,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335382016] [2019-10-13 19:50:54,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,374 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 19:50:54,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335382016] [2019-10-13 19:50:54,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:54,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530673256] [2019-10-13 19:50:54,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:54,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:54,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:54,378 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-13 19:50:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,666 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-10-13 19:50:54,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-13 19:50:54,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,669 INFO L225 Difference]: With dead ends: 669 [2019-10-13 19:50:54,670 INFO L226 Difference]: Without dead ends: 342 [2019-10-13 19:50:54,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-13 19:50:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-13 19:50:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-13 19:50:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-13 19:50:54,691 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-13 19:50:54,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,691 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-13 19:50:54,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:54,691 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-13 19:50:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:50:54,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,694 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:54,694 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1626624529, now seen corresponding path program 1 times [2019-10-13 19:50:54,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830160944] [2019-10-13 19:50:54,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,778 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 19:50:54,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830160944] [2019-10-13 19:50:54,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:54,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395018460] [2019-10-13 19:50:54,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:54,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:54,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:54,780 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-13 19:50:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,993 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-10-13 19:50:54,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-13 19:50:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,996 INFO L225 Difference]: With dead ends: 702 [2019-10-13 19:50:54,996 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 19:50:54,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 19:50:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-13 19:50:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-13 19:50:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-13 19:50:55,015 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-13 19:50:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,016 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-13 19:50:55,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-13 19:50:55,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:50:55,018 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,018 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:55,019 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1291287383, now seen corresponding path program 1 times [2019-10-13 19:50:55,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315735629] [2019-10-13 19:50:55,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,084 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 19:50:55,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315735629] [2019-10-13 19:50:55,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093136561] [2019-10-13 19:50:55,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,088 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-13 19:50:55,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,341 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-10-13 19:50:55,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 19:50:55,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,345 INFO L225 Difference]: With dead ends: 729 [2019-10-13 19:50:55,345 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 19:50:55,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 19:50:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-13 19:50:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-13 19:50:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-13 19:50:55,363 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-13 19:50:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,363 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-13 19:50:55,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-13 19:50:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 19:50:55,365 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,366 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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 19:50:55,366 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1329985514, now seen corresponding path program 1 times [2019-10-13 19:50:55,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515115018] [2019-10-13 19:50:55,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:55,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515115018] [2019-10-13 19:50:55,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839852885] [2019-10-13 19:50:55,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,430 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-13 19:50:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,624 INFO L93 Difference]: Finished difference Result 746 states and 1198 transitions. [2019-10-13 19:50:55,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-13 19:50:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,627 INFO L225 Difference]: With dead ends: 746 [2019-10-13 19:50:55,627 INFO L226 Difference]: Without dead ends: 392 [2019-10-13 19:50:55,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-13 19:50:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-13 19:50:55,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-13 19:50:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-13 19:50:55,650 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-13 19:50:55,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,651 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-13 19:50:55,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-13 19:50:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 19:50:55,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,653 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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 19:50:55,653 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1711185522, now seen corresponding path program 1 times [2019-10-13 19:50:55,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353178514] [2019-10-13 19:50:55,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:55,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353178514] [2019-10-13 19:50:55,708 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118848536] [2019-10-13 19:50:55,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,710 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-13 19:50:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,908 INFO L93 Difference]: Finished difference Result 767 states and 1221 transitions. [2019-10-13 19:50:55,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-13 19:50:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,912 INFO L225 Difference]: With dead ends: 767 [2019-10-13 19:50:55,912 INFO L226 Difference]: Without dead ends: 392 [2019-10-13 19:50:55,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-13 19:50:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-13 19:50:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-13 19:50:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-13 19:50:55,938 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-13 19:50:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,938 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-13 19:50:55,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-13 19:50:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 19:50:55,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,941 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:55,941 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1344904457, now seen corresponding path program 1 times [2019-10-13 19:50:55,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187964276] [2019-10-13 19:50:55,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 19:50:56,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187964276] [2019-10-13 19:50:56,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:56,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750455709] [2019-10-13 19:50:56,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:56,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:56,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:56,033 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-13 19:50:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,087 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-10-13 19:50:56,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:56,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-13 19:50:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,092 INFO L225 Difference]: With dead ends: 763 [2019-10-13 19:50:56,092 INFO L226 Difference]: Without dead ends: 761 [2019-10-13 19:50:56,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 19:50:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-13 19:50:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-13 19:50:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-13 19:50:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-13 19:50:56,133 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-13 19:50:56,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,133 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-13 19:50:56,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-13 19:50:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 19:50:56,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,136 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, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:56,136 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,137 INFO L82 PathProgramCache]: Analyzing trace with hash -773137702, now seen corresponding path program 1 times [2019-10-13 19:50:56,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159617011] [2019-10-13 19:50:56,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:56,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159617011] [2019-10-13 19:50:56,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:56,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342697950] [2019-10-13 19:50:56,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:56,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:56,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:56,202 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 5 states. [2019-10-13 19:50:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,450 INFO L93 Difference]: Finished difference Result 1593 states and 2521 transitions. [2019-10-13 19:50:56,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:56,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-10-13 19:50:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,455 INFO L225 Difference]: With dead ends: 1593 [2019-10-13 19:50:56,455 INFO L226 Difference]: Without dead ends: 845 [2019-10-13 19:50:56,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-10-13 19:50:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2019-10-13 19:50:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-10-13 19:50:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1319 transitions. [2019-10-13 19:50:56,494 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1319 transitions. Word has length 127 [2019-10-13 19:50:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,495 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1319 transitions. [2019-10-13 19:50:56,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1319 transitions. [2019-10-13 19:50:56,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 19:50:56,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,498 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, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:56,498 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,499 INFO L82 PathProgramCache]: Analyzing trace with hash -260517251, now seen corresponding path program 1 times [2019-10-13 19:50:56,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669739303] [2019-10-13 19:50:56,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:56,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669739303] [2019-10-13 19:50:56,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:56,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870960644] [2019-10-13 19:50:56,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:56,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:56,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:56,569 INFO L87 Difference]: Start difference. First operand 837 states and 1319 transitions. Second operand 5 states. [2019-10-13 19:50:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,822 INFO L93 Difference]: Finished difference Result 1669 states and 2633 transitions. [2019-10-13 19:50:56,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:56,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-10-13 19:50:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,829 INFO L225 Difference]: With dead ends: 1669 [2019-10-13 19:50:56,829 INFO L226 Difference]: Without dead ends: 841 [2019-10-13 19:50:56,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-10-13 19:50:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 833. [2019-10-13 19:50:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-10-13 19:50:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1307 transitions. [2019-10-13 19:50:56,894 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1307 transitions. Word has length 128 [2019-10-13 19:50:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,895 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1307 transitions. [2019-10-13 19:50:56,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1307 transitions. [2019-10-13 19:50:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-13 19:50:56,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,901 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, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:56,901 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1086305590, now seen corresponding path program 1 times [2019-10-13 19:50:56,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579146836] [2019-10-13 19:50:56,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-13 19:50:57,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579146836] [2019-10-13 19:50:57,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:57,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672289527] [2019-10-13 19:50:57,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:57,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:57,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:57,014 INFO L87 Difference]: Start difference. First operand 833 states and 1307 transitions. Second operand 5 states. [2019-10-13 19:50:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,374 INFO L93 Difference]: Finished difference Result 1729 states and 2717 transitions. [2019-10-13 19:50:57,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:57,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-13 19:50:57,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,381 INFO L225 Difference]: With dead ends: 1729 [2019-10-13 19:50:57,382 INFO L226 Difference]: Without dead ends: 909 [2019-10-13 19:50:57,384 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-10-13 19:50:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 905. [2019-10-13 19:50:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-10-13 19:50:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1415 transitions. [2019-10-13 19:50:57,443 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1415 transitions. Word has length 160 [2019-10-13 19:50:57,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,444 INFO L462 AbstractCegarLoop]: Abstraction has 905 states and 1415 transitions. [2019-10-13 19:50:57,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1415 transitions. [2019-10-13 19:50:57,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 19:50:57,450 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,451 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, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:57,451 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,452 INFO L82 PathProgramCache]: Analyzing trace with hash -643380505, now seen corresponding path program 1 times [2019-10-13 19:50:57,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50027517] [2019-10-13 19:50:57,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-13 19:50:57,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50027517] [2019-10-13 19:50:57,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:57,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435173475] [2019-10-13 19:50:57,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:57,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:57,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:57,565 INFO L87 Difference]: Start difference. First operand 905 states and 1415 transitions. Second operand 5 states. [2019-10-13 19:50:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,894 INFO L93 Difference]: Finished difference Result 1801 states and 2817 transitions. [2019-10-13 19:50:57,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:57,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-13 19:50:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,900 INFO L225 Difference]: With dead ends: 1801 [2019-10-13 19:50:57,900 INFO L226 Difference]: Without dead ends: 905 [2019-10-13 19:50:57,902 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-10-13 19:50:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 901. [2019-10-13 19:50:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-10-13 19:50:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1401 transitions. [2019-10-13 19:50:57,960 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1401 transitions. Word has length 161 [2019-10-13 19:50:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,960 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1401 transitions. [2019-10-13 19:50:57,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1401 transitions. [2019-10-13 19:50:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-13 19:50:57,964 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,964 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:57,965 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,965 INFO L82 PathProgramCache]: Analyzing trace with hash -306607681, now seen corresponding path program 1 times [2019-10-13 19:50:57,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241134913] [2019-10-13 19:50:57,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-13 19:50:58,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241134913] [2019-10-13 19:50:58,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398951563] [2019-10-13 19:50:58,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,058 INFO L87 Difference]: Start difference. First operand 901 states and 1401 transitions. Second operand 5 states. [2019-10-13 19:50:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,306 INFO L93 Difference]: Finished difference Result 1861 states and 2897 transitions. [2019-10-13 19:50:58,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:58,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-10-13 19:50:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,311 INFO L225 Difference]: With dead ends: 1861 [2019-10-13 19:50:58,311 INFO L226 Difference]: Without dead ends: 973 [2019-10-13 19:50:58,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:58,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-10-13 19:50:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 969. [2019-10-13 19:50:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-10-13 19:50:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1499 transitions. [2019-10-13 19:50:58,361 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1499 transitions. Word has length 191 [2019-10-13 19:50:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,362 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 1499 transitions. [2019-10-13 19:50:58,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1499 transitions. [2019-10-13 19:50:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-13 19:50:58,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,366 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:58,366 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1259797154, now seen corresponding path program 1 times [2019-10-13 19:50:58,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509036018] [2019-10-13 19:50:58,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-13 19:50:58,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509036018] [2019-10-13 19:50:58,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078399809] [2019-10-13 19:50:58,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,468 INFO L87 Difference]: Start difference. First operand 969 states and 1499 transitions. Second operand 5 states. [2019-10-13 19:50:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,723 INFO L93 Difference]: Finished difference Result 1929 states and 2985 transitions. [2019-10-13 19:50:58,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:58,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-10-13 19:50:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,729 INFO L225 Difference]: With dead ends: 1929 [2019-10-13 19:50:58,729 INFO L226 Difference]: Without dead ends: 969 [2019-10-13 19:50:58,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-10-13 19:50:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 965. [2019-10-13 19:50:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-10-13 19:50:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1483 transitions. [2019-10-13 19:50:58,773 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1483 transitions. Word has length 192 [2019-10-13 19:50:58,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,774 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1483 transitions. [2019-10-13 19:50:58,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1483 transitions. [2019-10-13 19:50:58,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-13 19:50:58,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,778 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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 19:50:58,779 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,779 INFO L82 PathProgramCache]: Analyzing trace with hash 637510067, now seen corresponding path program 1 times [2019-10-13 19:50:58,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311465630] [2019-10-13 19:50:58,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-13 19:50:58,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311465630] [2019-10-13 19:50:58,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619399548] [2019-10-13 19:50:58,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,911 INFO L87 Difference]: Start difference. First operand 965 states and 1483 transitions. Second operand 5 states. [2019-10-13 19:50:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:59,158 INFO L93 Difference]: Finished difference Result 1993 states and 3073 transitions. [2019-10-13 19:50:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:59,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-10-13 19:50:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:59,165 INFO L225 Difference]: With dead ends: 1993 [2019-10-13 19:50:59,165 INFO L226 Difference]: Without dead ends: 1041 [2019-10-13 19:50:59,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:59,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-13 19:50:59,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-10-13 19:50:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-13 19:50:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1547 transitions. [2019-10-13 19:50:59,217 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1547 transitions. Word has length 209 [2019-10-13 19:50:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:59,217 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1547 transitions. [2019-10-13 19:50:59,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1547 transitions. [2019-10-13 19:50:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-13 19:50:59,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:59,224 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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 19:50:59,225 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:59,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1262219653, now seen corresponding path program 1 times [2019-10-13 19:50:59,226 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:59,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101513401] [2019-10-13 19:50:59,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-13 19:50:59,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101513401] [2019-10-13 19:50:59,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:59,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:59,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487914462] [2019-10-13 19:50:59,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:59,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:59,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:59,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:59,425 INFO L87 Difference]: Start difference. First operand 1015 states and 1547 transitions. Second operand 5 states. [2019-10-13 19:50:59,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:59,744 INFO L93 Difference]: Finished difference Result 2043 states and 3119 transitions. [2019-10-13 19:50:59,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:59,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-10-13 19:50:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:59,752 INFO L225 Difference]: With dead ends: 2043 [2019-10-13 19:50:59,752 INFO L226 Difference]: Without dead ends: 1041 [2019-10-13 19:50:59,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:50:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-13 19:50:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-10-13 19:50:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-13 19:50:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1529 transitions. [2019-10-13 19:50:59,833 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1529 transitions. Word has length 210 [2019-10-13 19:50:59,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:59,833 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1529 transitions. [2019-10-13 19:50:59,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1529 transitions. [2019-10-13 19:50:59,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-13 19:50:59,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:59,841 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:59,842 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:59,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1315202570, now seen corresponding path program 1 times [2019-10-13 19:50:59,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:59,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21263259] [2019-10-13 19:50:59,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-13 19:50:59,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21263259] [2019-10-13 19:50:59,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:59,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:59,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568999808] [2019-10-13 19:50:59,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:59,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:59,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:59,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:59,981 INFO L87 Difference]: Start difference. First operand 1015 states and 1529 transitions. Second operand 5 states. [2019-10-13 19:51:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,259 INFO L93 Difference]: Finished difference Result 2025 states and 3051 transitions. [2019-10-13 19:51:00,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:00,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2019-10-13 19:51:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,265 INFO L225 Difference]: With dead ends: 2025 [2019-10-13 19:51:00,265 INFO L226 Difference]: Without dead ends: 1023 [2019-10-13 19:51:00,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:51:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-10-13 19:51:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1015. [2019-10-13 19:51:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-13 19:51:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1517 transitions. [2019-10-13 19:51:00,332 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1517 transitions. Word has length 222 [2019-10-13 19:51:00,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,332 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1517 transitions. [2019-10-13 19:51:00,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1517 transitions. [2019-10-13 19:51:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-13 19:51:00,336 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,337 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:00,337 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:00,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:00,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1975125977, now seen corresponding path program 1 times [2019-10-13 19:51:00,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:00,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260576183] [2019-10-13 19:51:00,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-13 19:51:00,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260576183] [2019-10-13 19:51:00,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:00,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:00,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428974037] [2019-10-13 19:51:00,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:00,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:00,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:00,450 INFO L87 Difference]: Start difference. First operand 1015 states and 1517 transitions. Second operand 5 states. [2019-10-13 19:51:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,686 INFO L93 Difference]: Finished difference Result 2025 states and 3027 transitions. [2019-10-13 19:51:00,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:00,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-10-13 19:51:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,691 INFO L225 Difference]: With dead ends: 2025 [2019-10-13 19:51:00,692 INFO L226 Difference]: Without dead ends: 1005 [2019-10-13 19:51:00,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:51:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-10-13 19:51:00,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 997. [2019-10-13 19:51:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-10-13 19:51:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1479 transitions. [2019-10-13 19:51:00,740 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1479 transitions. Word has length 223 [2019-10-13 19:51:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,740 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1479 transitions. [2019-10-13 19:51:00,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1479 transitions. [2019-10-13 19:51:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-13 19:51:00,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,745 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1] [2019-10-13 19:51:00,745 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:00,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:00,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1054088717, now seen corresponding path program 1 times [2019-10-13 19:51:00,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:00,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754617394] [2019-10-13 19:51:00,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-13 19:51:00,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754617394] [2019-10-13 19:51:00,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:00,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:00,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508429244] [2019-10-13 19:51:00,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:00,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:00,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:00,835 INFO L87 Difference]: Start difference. First operand 997 states and 1479 transitions. Second operand 5 states. [2019-10-13 19:51:01,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,062 INFO L93 Difference]: Finished difference Result 2035 states and 3025 transitions. [2019-10-13 19:51:01,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:01,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-10-13 19:51:01,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,068 INFO L225 Difference]: With dead ends: 2035 [2019-10-13 19:51:01,069 INFO L226 Difference]: Without dead ends: 1051 [2019-10-13 19:51:01,071 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:51:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-10-13 19:51:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1043. [2019-10-13 19:51:01,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-10-13 19:51:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1533 transitions. [2019-10-13 19:51:01,129 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1533 transitions. Word has length 230 [2019-10-13 19:51:01,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,129 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1533 transitions. [2019-10-13 19:51:01,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1533 transitions. [2019-10-13 19:51:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-13 19:51:01,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,134 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1] [2019-10-13 19:51:01,135 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,135 INFO L82 PathProgramCache]: Analyzing trace with hash 364858085, now seen corresponding path program 1 times [2019-10-13 19:51:01,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953462273] [2019-10-13 19:51:01,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-13 19:51:01,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953462273] [2019-10-13 19:51:01,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:01,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:01,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216448891] [2019-10-13 19:51:01,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:01,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:01,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:01,262 INFO L87 Difference]: Start difference. First operand 1043 states and 1533 transitions. Second operand 5 states. [2019-10-13 19:51:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,499 INFO L93 Difference]: Finished difference Result 2081 states and 3059 transitions. [2019-10-13 19:51:01,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:01,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-10-13 19:51:01,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,505 INFO L225 Difference]: With dead ends: 2081 [2019-10-13 19:51:01,505 INFO L226 Difference]: Without dead ends: 1043 [2019-10-13 19:51:01,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:51:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-10-13 19:51:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1035. [2019-10-13 19:51:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-10-13 19:51:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1501 transitions. [2019-10-13 19:51:01,559 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1501 transitions. Word has length 231 [2019-10-13 19:51:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,560 INFO L462 AbstractCegarLoop]: Abstraction has 1035 states and 1501 transitions. [2019-10-13 19:51:01,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1501 transitions. [2019-10-13 19:51:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-13 19:51:01,564 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,565 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:01,565 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,565 INFO L82 PathProgramCache]: Analyzing trace with hash -567208800, now seen corresponding path program 1 times [2019-10-13 19:51:01,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134557773] [2019-10-13 19:51:01,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-13 19:51:01,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134557773] [2019-10-13 19:51:01,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859032936] [2019-10-13 19:51:01,690 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 19:51:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 19:51:01,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-13 19:51:02,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:02,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:02,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301811637] [2019-10-13 19:51:02,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:02,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:02,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:02,025 INFO L87 Difference]: Start difference. First operand 1035 states and 1501 transitions. Second operand 3 states. [2019-10-13 19:51:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:02,128 INFO L93 Difference]: Finished difference Result 2567 states and 3726 transitions. [2019-10-13 19:51:02,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:02,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-10-13 19:51:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:02,137 INFO L225 Difference]: With dead ends: 2567 [2019-10-13 19:51:02,137 INFO L226 Difference]: Without dead ends: 1545 [2019-10-13 19:51:02,140 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 269 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 19:51:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2019-10-13 19:51:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2019-10-13 19:51:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1545 states. [2019-10-13 19:51:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2241 transitions. [2019-10-13 19:51:02,237 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2241 transitions. Word has length 267 [2019-10-13 19:51:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:02,238 INFO L462 AbstractCegarLoop]: Abstraction has 1545 states and 2241 transitions. [2019-10-13 19:51:02,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2241 transitions. [2019-10-13 19:51:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-13 19:51:02,244 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:02,244 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:02,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:02,450 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:02,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:02,450 INFO L82 PathProgramCache]: Analyzing trace with hash 767374129, now seen corresponding path program 1 times [2019-10-13 19:51:02,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:02,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227990583] [2019-10-13 19:51:02,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-13 19:51:02,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227990583] [2019-10-13 19:51:02,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:02,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:02,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071749061] [2019-10-13 19:51:02,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:02,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:02,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:02,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:02,617 INFO L87 Difference]: Start difference. First operand 1545 states and 2241 transitions. Second operand 3 states. [2019-10-13 19:51:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:02,773 INFO L93 Difference]: Finished difference Result 4528 states and 6569 transitions. [2019-10-13 19:51:02,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:02,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-13 19:51:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:02,791 INFO L225 Difference]: With dead ends: 4528 [2019-10-13 19:51:02,791 INFO L226 Difference]: Without dead ends: 2996 [2019-10-13 19:51:02,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 19:51:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2019-10-13 19:51:03,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2994. [2019-10-13 19:51:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2994 states. [2019-10-13 19:51:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 4335 transitions. [2019-10-13 19:51:03,090 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 4335 transitions. Word has length 274 [2019-10-13 19:51:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:03,091 INFO L462 AbstractCegarLoop]: Abstraction has 2994 states and 4335 transitions. [2019-10-13 19:51:03,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 4335 transitions. [2019-10-13 19:51:03,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-13 19:51:03,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,107 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:51:03,107 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1658002288, now seen corresponding path program 1 times [2019-10-13 19:51:03,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035053223] [2019-10-13 19:51:03,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-13 19:51:03,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035053223] [2019-10-13 19:51:03,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:03,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:03,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352061798] [2019-10-13 19:51:03,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:03,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:03,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:03,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:03,228 INFO L87 Difference]: Start difference. First operand 2994 states and 4335 transitions. Second operand 3 states. [2019-10-13 19:51:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:03,496 INFO L93 Difference]: Finished difference Result 6095 states and 8845 transitions. [2019-10-13 19:51:03,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:03,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-10-13 19:51:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:03,509 INFO L225 Difference]: With dead ends: 6095 [2019-10-13 19:51:03,509 INFO L226 Difference]: Without dead ends: 1997 [2019-10-13 19:51:03,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 19:51:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-10-13 19:51:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1977. [2019-10-13 19:51:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2019-10-13 19:51:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2813 transitions. [2019-10-13 19:51:03,631 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2813 transitions. Word has length 311 [2019-10-13 19:51:03,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:03,632 INFO L462 AbstractCegarLoop]: Abstraction has 1977 states and 2813 transitions. [2019-10-13 19:51:03,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2813 transitions. [2019-10-13 19:51:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-13 19:51:03,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,641 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-10-13 19:51:03,641 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,642 INFO L82 PathProgramCache]: Analyzing trace with hash -872859034, now seen corresponding path program 1 times [2019-10-13 19:51:03,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600555412] [2019-10-13 19:51:03,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-13 19:51:03,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600555412] [2019-10-13 19:51:03,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162685750] [2019-10-13 19:51:03,862 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 19:51:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:04,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-13 19:51:04,142 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:04,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:04,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976807990] [2019-10-13 19:51:04,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:04,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:04,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:04,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:04,148 INFO L87 Difference]: Start difference. First operand 1977 states and 2813 transitions. Second operand 4 states. [2019-10-13 19:51:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:04,549 INFO L93 Difference]: Finished difference Result 4590 states and 6521 transitions. [2019-10-13 19:51:04,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:04,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2019-10-13 19:51:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:04,579 INFO L225 Difference]: With dead ends: 4590 [2019-10-13 19:51:04,579 INFO L226 Difference]: Without dead ends: 2582 [2019-10-13 19:51:04,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2019-10-13 19:51:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 1954. [2019-10-13 19:51:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-10-13 19:51:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2698 transitions. [2019-10-13 19:51:04,737 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2698 transitions. Word has length 377 [2019-10-13 19:51:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:04,738 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2698 transitions. [2019-10-13 19:51:04,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2698 transitions. [2019-10-13 19:51:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-10-13 19:51:04,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:04,755 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 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, 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] [2019-10-13 19:51:04,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:04,961 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:04,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:04,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1790317548, now seen corresponding path program 1 times [2019-10-13 19:51:04,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:04,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271625079] [2019-10-13 19:51:04,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-13 19:51:05,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271625079] [2019-10-13 19:51:05,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641099482] [2019-10-13 19:51:05,318 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 19:51:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:05,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-13 19:51:05,791 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:05,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:05,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852266578] [2019-10-13 19:51:05,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:05,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:05,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:05,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:05,795 INFO L87 Difference]: Start difference. First operand 1954 states and 2698 transitions. Second operand 4 states. [2019-10-13 19:51:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:06,140 INFO L93 Difference]: Finished difference Result 4809 states and 6669 transitions. [2019-10-13 19:51:06,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:51:06,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 605 [2019-10-13 19:51:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:06,148 INFO L225 Difference]: With dead ends: 4809 [2019-10-13 19:51:06,148 INFO L226 Difference]: Without dead ends: 2736 [2019-10-13 19:51:06,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-10-13 19:51:06,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1954. [2019-10-13 19:51:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-10-13 19:51:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2698 transitions. [2019-10-13 19:51:06,269 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2698 transitions. Word has length 605 [2019-10-13 19:51:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:06,270 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2698 transitions. [2019-10-13 19:51:06,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2698 transitions. [2019-10-13 19:51:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-10-13 19:51:06,290 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:06,291 INFO L380 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 19:51:06,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:06,497 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:06,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1901319823, now seen corresponding path program 1 times [2019-10-13 19:51:06,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:06,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922876827] [2019-10-13 19:51:06,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-10-13 19:51:06,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922876827] [2019-10-13 19:51:06,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:06,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:06,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797050782] [2019-10-13 19:51:06,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:06,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:06,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:06,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:06,858 INFO L87 Difference]: Start difference. First operand 1954 states and 2698 transitions. Second operand 3 states. [2019-10-13 19:51:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:07,090 INFO L93 Difference]: Finished difference Result 3929 states and 5418 transitions. [2019-10-13 19:51:07,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:07,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 675 [2019-10-13 19:51:07,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:07,095 INFO L225 Difference]: With dead ends: 3929 [2019-10-13 19:51:07,096 INFO L226 Difference]: Without dead ends: 1994 [2019-10-13 19:51:07,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 19:51:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2019-10-13 19:51:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1954. [2019-10-13 19:51:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-10-13 19:51:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2678 transitions. [2019-10-13 19:51:07,190 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2678 transitions. Word has length 675 [2019-10-13 19:51:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:07,191 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2678 transitions. [2019-10-13 19:51:07,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2678 transitions. [2019-10-13 19:51:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-10-13 19:51:07,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:07,200 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:07,200 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:07,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:07,201 INFO L82 PathProgramCache]: Analyzing trace with hash -554544010, now seen corresponding path program 1 times [2019-10-13 19:51:07,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:07,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927258607] [2019-10-13 19:51:07,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-10-13 19:51:07,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927258607] [2019-10-13 19:51:07,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:07,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:07,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609618367] [2019-10-13 19:51:07,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:07,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:07,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:07,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:07,645 INFO L87 Difference]: Start difference. First operand 1954 states and 2678 transitions. Second operand 3 states. [2019-10-13 19:51:07,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:07,865 INFO L93 Difference]: Finished difference Result 3921 states and 5369 transitions. [2019-10-13 19:51:07,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:07,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 689 [2019-10-13 19:51:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:07,870 INFO L225 Difference]: With dead ends: 3921 [2019-10-13 19:51:07,870 INFO L226 Difference]: Without dead ends: 1986 [2019-10-13 19:51:07,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 19:51:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2019-10-13 19:51:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1941. [2019-10-13 19:51:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2019-10-13 19:51:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2619 transitions. [2019-10-13 19:51:07,964 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2619 transitions. Word has length 689 [2019-10-13 19:51:07,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:07,965 INFO L462 AbstractCegarLoop]: Abstraction has 1941 states and 2619 transitions. [2019-10-13 19:51:07,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2619 transitions. [2019-10-13 19:51:07,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-10-13 19:51:07,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:07,973 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:07,973 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:07,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:07,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1850705057, now seen corresponding path program 1 times [2019-10-13 19:51:07,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:07,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290481433] [2019-10-13 19:51:07,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-10-13 19:51:08,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290481433] [2019-10-13 19:51:08,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:08,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:08,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155653727] [2019-10-13 19:51:08,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:08,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:08,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:08,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:08,342 INFO L87 Difference]: Start difference. First operand 1941 states and 2619 transitions. Second operand 3 states. [2019-10-13 19:51:08,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:08,542 INFO L93 Difference]: Finished difference Result 3943 states and 5323 transitions. [2019-10-13 19:51:08,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:08,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 717 [2019-10-13 19:51:08,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:08,549 INFO L225 Difference]: With dead ends: 3943 [2019-10-13 19:51:08,549 INFO L226 Difference]: Without dead ends: 2003 [2019-10-13 19:51:08,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 19:51:08,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2019-10-13 19:51:08,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1983. [2019-10-13 19:51:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2019-10-13 19:51:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2664 transitions. [2019-10-13 19:51:08,663 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2664 transitions. Word has length 717 [2019-10-13 19:51:08,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:08,664 INFO L462 AbstractCegarLoop]: Abstraction has 1983 states and 2664 transitions. [2019-10-13 19:51:08,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2664 transitions. [2019-10-13 19:51:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-10-13 19:51:08,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:08,672 INFO L380 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:08,672 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:08,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:08,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1896110854, now seen corresponding path program 1 times [2019-10-13 19:51:08,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:08,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147017057] [2019-10-13 19:51:08,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:08,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:08,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-10-13 19:51:09,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147017057] [2019-10-13 19:51:09,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:09,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:09,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720142582] [2019-10-13 19:51:09,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:09,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:09,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:09,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:09,062 INFO L87 Difference]: Start difference. First operand 1983 states and 2664 transitions. Second operand 3 states. [2019-10-13 19:51:09,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:09,230 INFO L93 Difference]: Finished difference Result 2548 states and 3406 transitions. [2019-10-13 19:51:09,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:09,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 732 [2019-10-13 19:51:09,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:09,232 INFO L225 Difference]: With dead ends: 2548 [2019-10-13 19:51:09,232 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:51:09,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 19:51:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:51:09,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:51:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:51:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:51:09,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 732 [2019-10-13 19:51:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:09,238 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:51:09,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:09,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:51:09,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:51:09,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:51:09,353 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 153 [2019-10-13 19:51:10,291 WARN L191 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 176 [2019-10-13 19:51:10,681 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 159 [2019-10-13 19:51:11,044 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 175 [2019-10-13 19:51:12,454 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-10-13 19:51:13,379 WARN L191 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 118 [2019-10-13 19:51:14,124 WARN L191 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 120 [2019-10-13 19:51:15,066 WARN L191 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 123 [2019-10-13 19:51:15,495 WARN L191 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 108 [2019-10-13 19:51:16,253 WARN L191 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 117 [2019-10-13 19:51:17,026 WARN L191 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 117 [2019-10-13 19:51:18,339 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-10-13 19:51:19,477 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 157 DAG size of output: 120