java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:27:36,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:27:36,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:27:36,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:27:36,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:27:36,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:27:36,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:27:36,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:27:36,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:27:36,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:27:36,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:27:36,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:27:36,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:27:36,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:27:36,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:27:36,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:27:36,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:27:36,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:27:36,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:27:36,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:27:36,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:27:36,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:27:36,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:27:36,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:27:36,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:27:36,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:27:36,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:27:36,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:27:36,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:27:36,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:27:36,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:27:36,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:27:36,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:27:36,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:27:36,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:27:36,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:27:36,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:27:36,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:27:36,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:27:36,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:27:36,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:27:36,573 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:27:36,606 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:27:36,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:27:36,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:27:36,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:27:36,610 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:27:36,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:27:36,610 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:27:36,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:27:36,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:27:36,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:27:36,615 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:27:36,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:27:36,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:27:36,616 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:27:36,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:27:36,616 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:27:36,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:27:36,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:27:36,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:27:36,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:27:36,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:27:36,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:36,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:27:36,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:27:36,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:27:36,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:27:36,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:27:36,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:27:36,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:27:36,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:27:36,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:27:36,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:27:36,925 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:27:36,925 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:27:36,926 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-10-15 01:27:37,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbabdcfd2/a12cd6c3211a43b8a8b0a495f3ec48f4/FLAG685817545 [2019-10-15 01:27:37,570 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:27:37,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-10-15 01:27:37,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbabdcfd2/a12cd6c3211a43b8a8b0a495f3ec48f4/FLAG685817545 [2019-10-15 01:27:37,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbabdcfd2/a12cd6c3211a43b8a8b0a495f3ec48f4 [2019-10-15 01:27:37,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:27:37,895 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:27:37,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:37,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:27:37,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:27:37,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:37" (1/1) ... [2019-10-15 01:27:37,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f9cf7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:37, skipping insertion in model container [2019-10-15 01:27:37,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:37" (1/1) ... [2019-10-15 01:27:37,911 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:27:37,968 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:27:38,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:38,427 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:27:38,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:38,567 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:27:38,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:38 WrapperNode [2019-10-15 01:27:38,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:38,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:27:38,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:27:38,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:27:38,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:38" (1/1) ... [2019-10-15 01:27:38,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:38" (1/1) ... [2019-10-15 01:27:38,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:38" (1/1) ... [2019-10-15 01:27:38,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:38" (1/1) ... [2019-10-15 01:27:38,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:38" (1/1) ... [2019-10-15 01:27:38,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:38" (1/1) ... [2019-10-15 01:27:38,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:38" (1/1) ... [2019-10-15 01:27:38,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:27:38,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:27:38,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:27:38,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:27:38,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:38,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:27:38,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:27:38,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-15 01:27:38,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:27:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:27:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:27:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-15 01:27:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:27:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:27:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:27:38,860 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:27:39,405 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-15 01:27:39,405 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-15 01:27:39,418 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:27:39,418 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:27:39,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:39 BoogieIcfgContainer [2019-10-15 01:27:39,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:27:39,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:27:39,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:27:39,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:27:39,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:27:37" (1/3) ... [2019-10-15 01:27:39,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256cfec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:39, skipping insertion in model container [2019-10-15 01:27:39,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:38" (2/3) ... [2019-10-15 01:27:39,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256cfec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:39, skipping insertion in model container [2019-10-15 01:27:39,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:39" (3/3) ... [2019-10-15 01:27:39,429 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-10-15 01:27:39,441 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:27:39,450 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:27:39,462 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:27:39,490 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:27:39,491 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:27:39,491 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:27:39,492 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:27:39,492 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:27:39,492 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:27:39,492 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:27:39,492 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:27:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2019-10-15 01:27:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:27:39,522 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:39,523 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:39,525 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:39,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:39,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2007307722, now seen corresponding path program 1 times [2019-10-15 01:27:39,543 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:39,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620329323] [2019-10-15 01:27:39,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:39,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:39,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:39,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620329323] [2019-10-15 01:27:39,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:39,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:39,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284939621] [2019-10-15 01:27:39,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:39,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:39,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:39,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:39,781 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 3 states. [2019-10-15 01:27:39,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:39,933 INFO L93 Difference]: Finished difference Result 365 states and 622 transitions. [2019-10-15 01:27:39,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:39,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:27:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:39,954 INFO L225 Difference]: With dead ends: 365 [2019-10-15 01:27:39,955 INFO L226 Difference]: Without dead ends: 214 [2019-10-15 01:27:39,960 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:39,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-15 01:27:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-10-15 01:27:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-15 01:27:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 320 transitions. [2019-10-15 01:27:40,030 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 320 transitions. Word has length 29 [2019-10-15 01:27:40,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:40,031 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-10-15 01:27:40,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:40,032 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 320 transitions. [2019-10-15 01:27:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:27:40,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:40,037 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:40,038 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1381474291, now seen corresponding path program 1 times [2019-10-15 01:27:40,039 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:40,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161559305] [2019-10-15 01:27:40,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:40,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161559305] [2019-10-15 01:27:40,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:40,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:40,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623491693] [2019-10-15 01:27:40,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:40,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:40,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:40,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,123 INFO L87 Difference]: Start difference. First operand 214 states and 320 transitions. Second operand 3 states. [2019-10-15 01:27:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:40,342 INFO L93 Difference]: Finished difference Result 460 states and 698 transitions. [2019-10-15 01:27:40,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:40,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-15 01:27:40,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:40,349 INFO L225 Difference]: With dead ends: 460 [2019-10-15 01:27:40,349 INFO L226 Difference]: Without dead ends: 258 [2019-10-15 01:27:40,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-15 01:27:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2019-10-15 01:27:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-15 01:27:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 364 transitions. [2019-10-15 01:27:40,372 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 364 transitions. Word has length 43 [2019-10-15 01:27:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:40,373 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 364 transitions. [2019-10-15 01:27:40,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 364 transitions. [2019-10-15 01:27:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:27:40,376 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:40,376 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:27:40,377 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:40,377 INFO L82 PathProgramCache]: Analyzing trace with hash 632602009, now seen corresponding path program 1 times [2019-10-15 01:27:40,377 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:40,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771215242] [2019-10-15 01:27:40,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:27:40,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771215242] [2019-10-15 01:27:40,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:40,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:40,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688889554] [2019-10-15 01:27:40,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:40,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:40,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:40,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,491 INFO L87 Difference]: Start difference. First operand 248 states and 364 transitions. Second operand 3 states. [2019-10-15 01:27:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:40,708 INFO L93 Difference]: Finished difference Result 584 states and 888 transitions. [2019-10-15 01:27:40,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:40,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:27:40,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:40,712 INFO L225 Difference]: With dead ends: 584 [2019-10-15 01:27:40,712 INFO L226 Difference]: Without dead ends: 346 [2019-10-15 01:27:40,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-15 01:27:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 330. [2019-10-15 01:27:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-10-15 01:27:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 464 transitions. [2019-10-15 01:27:40,755 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 464 transitions. Word has length 60 [2019-10-15 01:27:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:40,756 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 464 transitions. [2019-10-15 01:27:40,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 464 transitions. [2019-10-15 01:27:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:27:40,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:40,760 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:27:40,760 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:40,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:40,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1172836325, now seen corresponding path program 1 times [2019-10-15 01:27:40,761 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:40,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505383332] [2019-10-15 01:27:40,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:27:40,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505383332] [2019-10-15 01:27:40,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:40,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:40,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739232256] [2019-10-15 01:27:40,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:40,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:40,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:40,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,821 INFO L87 Difference]: Start difference. First operand 330 states and 464 transitions. Second operand 3 states. [2019-10-15 01:27:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,008 INFO L93 Difference]: Finished difference Result 694 states and 991 transitions. [2019-10-15 01:27:41,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:27:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,014 INFO L225 Difference]: With dead ends: 694 [2019-10-15 01:27:41,014 INFO L226 Difference]: Without dead ends: 376 [2019-10-15 01:27:41,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-10-15 01:27:41,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2019-10-15 01:27:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-10-15 01:27:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 512 transitions. [2019-10-15 01:27:41,045 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 512 transitions. Word has length 60 [2019-10-15 01:27:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,046 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 512 transitions. [2019-10-15 01:27:41,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 512 transitions. [2019-10-15 01:27:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 01:27:41,054 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,055 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:27:41,055 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,056 INFO L82 PathProgramCache]: Analyzing trace with hash 244907033, now seen corresponding path program 1 times [2019-10-15 01:27:41,056 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88196813] [2019-10-15 01:27:41,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:27:41,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88196813] [2019-10-15 01:27:41,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460614601] [2019-10-15 01:27:41,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,170 INFO L87 Difference]: Start difference. First operand 368 states and 512 transitions. Second operand 3 states. [2019-10-15 01:27:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,391 INFO L93 Difference]: Finished difference Result 828 states and 1190 transitions. [2019-10-15 01:27:41,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-15 01:27:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,395 INFO L225 Difference]: With dead ends: 828 [2019-10-15 01:27:41,396 INFO L226 Difference]: Without dead ends: 470 [2019-10-15 01:27:41,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-15 01:27:41,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 446. [2019-10-15 01:27:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-15 01:27:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 646 transitions. [2019-10-15 01:27:41,414 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 646 transitions. Word has length 72 [2019-10-15 01:27:41,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,415 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 646 transitions. [2019-10-15 01:27:41,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 646 transitions. [2019-10-15 01:27:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 01:27:41,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,417 INFO L380 BasicCegarLoop]: trace histogram [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-15 01:27:41,418 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,418 INFO L82 PathProgramCache]: Analyzing trace with hash -834546447, now seen corresponding path program 1 times [2019-10-15 01:27:41,418 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521596559] [2019-10-15 01:27:41,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-15 01:27:41,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521596559] [2019-10-15 01:27:41,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839478627] [2019-10-15 01:27:41,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,487 INFO L87 Difference]: Start difference. First operand 446 states and 646 transitions. Second operand 3 states. [2019-10-15 01:27:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,631 INFO L93 Difference]: Finished difference Result 928 states and 1353 transitions. [2019-10-15 01:27:41,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-15 01:27:41,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,635 INFO L225 Difference]: With dead ends: 928 [2019-10-15 01:27:41,636 INFO L226 Difference]: Without dead ends: 494 [2019-10-15 01:27:41,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-15 01:27:41,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2019-10-15 01:27:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-10-15 01:27:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 698 transitions. [2019-10-15 01:27:41,655 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 698 transitions. Word has length 76 [2019-10-15 01:27:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,656 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 698 transitions. [2019-10-15 01:27:41,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 698 transitions. [2019-10-15 01:27:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:27:41,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,659 INFO L380 BasicCegarLoop]: trace histogram [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-15 01:27:41,659 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash -532111447, now seen corresponding path program 1 times [2019-10-15 01:27:41,660 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650051728] [2019-10-15 01:27:41,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:27:41,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650051728] [2019-10-15 01:27:41,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772743942] [2019-10-15 01:27:41,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,737 INFO L87 Difference]: Start difference. First operand 488 states and 698 transitions. Second operand 3 states. [2019-10-15 01:27:41,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,794 INFO L93 Difference]: Finished difference Result 964 states and 1385 transitions. [2019-10-15 01:27:41,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-15 01:27:41,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,800 INFO L225 Difference]: With dead ends: 964 [2019-10-15 01:27:41,800 INFO L226 Difference]: Without dead ends: 725 [2019-10-15 01:27:41,801 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-10-15 01:27:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2019-10-15 01:27:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-10-15 01:27:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1038 transitions. [2019-10-15 01:27:41,825 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1038 transitions. Word has length 96 [2019-10-15 01:27:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,825 INFO L462 AbstractCegarLoop]: Abstraction has 725 states and 1038 transitions. [2019-10-15 01:27:41,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1038 transitions. [2019-10-15 01:27:41,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:27:41,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,828 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-10-15 01:27:41,828 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2130642131, now seen corresponding path program 1 times [2019-10-15 01:27:41,829 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726888130] [2019-10-15 01:27:41,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-15 01:27:41,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726888130] [2019-10-15 01:27:41,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058715066] [2019-10-15 01:27:41,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,902 INFO L87 Difference]: Start difference. First operand 725 states and 1038 transitions. Second operand 3 states. [2019-10-15 01:27:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,960 INFO L93 Difference]: Finished difference Result 964 states and 1382 transitions. [2019-10-15 01:27:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-15 01:27:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,967 INFO L225 Difference]: With dead ends: 964 [2019-10-15 01:27:41,967 INFO L226 Difference]: Without dead ends: 962 [2019-10-15 01:27:41,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-10-15 01:27:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2019-10-15 01:27:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-10-15 01:27:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1380 transitions. [2019-10-15 01:27:41,997 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1380 transitions. Word has length 98 [2019-10-15 01:27:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,998 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 1380 transitions. [2019-10-15 01:27:41,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1380 transitions. [2019-10-15 01:27:42,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:27:42,002 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,002 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:42,002 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1135672730, now seen corresponding path program 1 times [2019-10-15 01:27:42,003 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029055840] [2019-10-15 01:27:42,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,004 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-15 01:27:42,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029055840] [2019-10-15 01:27:42,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256725402] [2019-10-15 01:27:42,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,097 INFO L87 Difference]: Start difference. First operand 962 states and 1380 transitions. Second operand 3 states. [2019-10-15 01:27:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,278 INFO L93 Difference]: Finished difference Result 2112 states and 3080 transitions. [2019-10-15 01:27:42,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-15 01:27:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,286 INFO L225 Difference]: With dead ends: 2112 [2019-10-15 01:27:42,286 INFO L226 Difference]: Without dead ends: 1154 [2019-10-15 01:27:42,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-10-15 01:27:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1118. [2019-10-15 01:27:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-10-15 01:27:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1620 transitions. [2019-10-15 01:27:42,329 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1620 transitions. Word has length 152 [2019-10-15 01:27:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,330 INFO L462 AbstractCegarLoop]: Abstraction has 1118 states and 1620 transitions. [2019-10-15 01:27:42,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1620 transitions. [2019-10-15 01:27:42,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-15 01:27:42,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,342 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 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] [2019-10-15 01:27:42,342 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,346 INFO L82 PathProgramCache]: Analyzing trace with hash -862106901, now seen corresponding path program 1 times [2019-10-15 01:27:42,346 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716708953] [2019-10-15 01:27:42,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-15 01:27:42,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716708953] [2019-10-15 01:27:42,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652484215] [2019-10-15 01:27:42,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,478 INFO L87 Difference]: Start difference. First operand 1118 states and 1620 transitions. Second operand 3 states. [2019-10-15 01:27:42,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,662 INFO L93 Difference]: Finished difference Result 2330 states and 3354 transitions. [2019-10-15 01:27:42,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-15 01:27:42,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,673 INFO L225 Difference]: With dead ends: 2330 [2019-10-15 01:27:42,673 INFO L226 Difference]: Without dead ends: 1224 [2019-10-15 01:27:42,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-10-15 01:27:42,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1210. [2019-10-15 01:27:42,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-10-15 01:27:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1732 transitions. [2019-10-15 01:27:42,744 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1732 transitions. Word has length 188 [2019-10-15 01:27:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,744 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 1732 transitions. [2019-10-15 01:27:42,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1732 transitions. [2019-10-15 01:27:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-15 01:27:42,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,751 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:42,752 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2139251602, now seen corresponding path program 1 times [2019-10-15 01:27:42,752 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529170867] [2019-10-15 01:27:42,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-15 01:27:42,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529170867] [2019-10-15 01:27:42,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507072826] [2019-10-15 01:27:42,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,863 INFO L87 Difference]: Start difference. First operand 1210 states and 1732 transitions. Second operand 3 states. [2019-10-15 01:27:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,121 INFO L93 Difference]: Finished difference Result 2520 states and 3596 transitions. [2019-10-15 01:27:43,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:43,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-10-15 01:27:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,132 INFO L225 Difference]: With dead ends: 2520 [2019-10-15 01:27:43,132 INFO L226 Difference]: Without dead ends: 1322 [2019-10-15 01:27:43,136 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-10-15 01:27:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1310. [2019-10-15 01:27:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-10-15 01:27:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1852 transitions. [2019-10-15 01:27:43,177 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1852 transitions. Word has length 209 [2019-10-15 01:27:43,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:43,177 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1852 transitions. [2019-10-15 01:27:43,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:43,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1852 transitions. [2019-10-15 01:27:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-15 01:27:43,185 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:43,185 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:43,186 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:43,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:43,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1924345883, now seen corresponding path program 1 times [2019-10-15 01:27:43,186 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:43,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518027609] [2019-10-15 01:27:43,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-15 01:27:43,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518027609] [2019-10-15 01:27:43,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:43,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:43,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119460549] [2019-10-15 01:27:43,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:43,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:43,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,298 INFO L87 Difference]: Start difference. First operand 1310 states and 1852 transitions. Second operand 3 states. [2019-10-15 01:27:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,432 INFO L93 Difference]: Finished difference Result 2728 states and 3848 transitions. [2019-10-15 01:27:43,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:43,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-15 01:27:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,441 INFO L225 Difference]: With dead ends: 2728 [2019-10-15 01:27:43,442 INFO L226 Difference]: Without dead ends: 1430 [2019-10-15 01:27:43,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-10-15 01:27:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1422. [2019-10-15 01:27:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2019-10-15 01:27:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1984 transitions. [2019-10-15 01:27:43,484 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1984 transitions. Word has length 233 [2019-10-15 01:27:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:43,484 INFO L462 AbstractCegarLoop]: Abstraction has 1422 states and 1984 transitions. [2019-10-15 01:27:43,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1984 transitions. [2019-10-15 01:27:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-15 01:27:43,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:43,490 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:43,490 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:43,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:43,491 INFO L82 PathProgramCache]: Analyzing trace with hash -643476451, now seen corresponding path program 1 times [2019-10-15 01:27:43,491 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:43,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879866677] [2019-10-15 01:27:43,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-15 01:27:43,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879866677] [2019-10-15 01:27:43,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:43,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:43,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024473859] [2019-10-15 01:27:43,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:43,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:43,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,591 INFO L87 Difference]: Start difference. First operand 1422 states and 1984 transitions. Second operand 3 states. [2019-10-15 01:27:43,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,742 INFO L93 Difference]: Finished difference Result 2968 states and 4148 transitions. [2019-10-15 01:27:43,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:43,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-15 01:27:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,751 INFO L225 Difference]: With dead ends: 2968 [2019-10-15 01:27:43,751 INFO L226 Difference]: Without dead ends: 1558 [2019-10-15 01:27:43,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-10-15 01:27:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1546. [2019-10-15 01:27:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-10-15 01:27:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2128 transitions. [2019-10-15 01:27:43,799 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2128 transitions. Word has length 233 [2019-10-15 01:27:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:43,799 INFO L462 AbstractCegarLoop]: Abstraction has 1546 states and 2128 transitions. [2019-10-15 01:27:43,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2128 transitions. [2019-10-15 01:27:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-15 01:27:43,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:43,807 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:43,807 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:43,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:43,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1388986723, now seen corresponding path program 1 times [2019-10-15 01:27:43,808 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:43,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220728212] [2019-10-15 01:27:43,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-10-15 01:27:43,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220728212] [2019-10-15 01:27:43,923 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:43,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:43,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871422043] [2019-10-15 01:27:43,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:43,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:43,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,925 INFO L87 Difference]: Start difference. First operand 1546 states and 2128 transitions. Second operand 3 states. [2019-10-15 01:27:44,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:44,082 INFO L93 Difference]: Finished difference Result 3232 states and 4464 transitions. [2019-10-15 01:27:44,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:44,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-15 01:27:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:44,094 INFO L225 Difference]: With dead ends: 3232 [2019-10-15 01:27:44,094 INFO L226 Difference]: Without dead ends: 1698 [2019-10-15 01:27:44,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-10-15 01:27:44,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1690. [2019-10-15 01:27:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-10-15 01:27:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2292 transitions. [2019-10-15 01:27:44,142 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2292 transitions. Word has length 263 [2019-10-15 01:27:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:44,143 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 2292 transitions. [2019-10-15 01:27:44,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:44,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2292 transitions. [2019-10-15 01:27:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-15 01:27:44,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:44,150 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:44,150 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:44,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:44,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1178835611, now seen corresponding path program 1 times [2019-10-15 01:27:44,151 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:44,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843462591] [2019-10-15 01:27:44,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-10-15 01:27:44,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843462591] [2019-10-15 01:27:44,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:44,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:44,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600037623] [2019-10-15 01:27:44,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:44,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:44,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:44,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,238 INFO L87 Difference]: Start difference. First operand 1690 states and 2292 transitions. Second operand 3 states. [2019-10-15 01:27:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:44,293 INFO L93 Difference]: Finished difference Result 5038 states and 6836 transitions. [2019-10-15 01:27:44,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:44,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-15 01:27:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:44,316 INFO L225 Difference]: With dead ends: 5038 [2019-10-15 01:27:44,316 INFO L226 Difference]: Without dead ends: 3360 [2019-10-15 01:27:44,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2019-10-15 01:27:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3358. [2019-10-15 01:27:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3358 states. [2019-10-15 01:27:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4555 transitions. [2019-10-15 01:27:44,504 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4555 transitions. Word has length 263 [2019-10-15 01:27:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:44,505 INFO L462 AbstractCegarLoop]: Abstraction has 3358 states and 4555 transitions. [2019-10-15 01:27:44,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4555 transitions. [2019-10-15 01:27:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-15 01:27:44,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:44,522 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:44,522 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:44,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:44,523 INFO L82 PathProgramCache]: Analyzing trace with hash 554282629, now seen corresponding path program 1 times [2019-10-15 01:27:44,523 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:44,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697591957] [2019-10-15 01:27:44,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-10-15 01:27:44,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697591957] [2019-10-15 01:27:44,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:44,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:44,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596903993] [2019-10-15 01:27:44,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:44,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:44,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:44,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,689 INFO L87 Difference]: Start difference. First operand 3358 states and 4555 transitions. Second operand 3 states. [2019-10-15 01:27:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:44,863 INFO L93 Difference]: Finished difference Result 6852 states and 9306 transitions. [2019-10-15 01:27:44,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:44,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-10-15 01:27:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:44,881 INFO L225 Difference]: With dead ends: 6852 [2019-10-15 01:27:44,882 INFO L226 Difference]: Without dead ends: 3506 [2019-10-15 01:27:44,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2019-10-15 01:27:44,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3490. [2019-10-15 01:27:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-10-15 01:27:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4707 transitions. [2019-10-15 01:27:44,997 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4707 transitions. Word has length 287 [2019-10-15 01:27:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:44,997 INFO L462 AbstractCegarLoop]: Abstraction has 3490 states and 4707 transitions. [2019-10-15 01:27:44,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4707 transitions. [2019-10-15 01:27:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-15 01:27:45,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:45,009 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:45,010 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:45,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:45,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1163110431, now seen corresponding path program 1 times [2019-10-15 01:27:45,011 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:45,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516415200] [2019-10-15 01:27:45,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 541 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-15 01:27:45,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516415200] [2019-10-15 01:27:45,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:45,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:45,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009446204] [2019-10-15 01:27:45,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:45,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:45,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:45,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:45,158 INFO L87 Difference]: Start difference. First operand 3490 states and 4707 transitions. Second operand 3 states. [2019-10-15 01:27:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:45,415 INFO L93 Difference]: Finished difference Result 7360 states and 10062 transitions. [2019-10-15 01:27:45,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:45,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-10-15 01:27:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:45,440 INFO L225 Difference]: With dead ends: 7360 [2019-10-15 01:27:45,441 INFO L226 Difference]: Without dead ends: 3882 [2019-10-15 01:27:45,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2019-10-15 01:27:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3802. [2019-10-15 01:27:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3802 states. [2019-10-15 01:27:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 5075 transitions. [2019-10-15 01:27:45,595 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 5075 transitions. Word has length 298 [2019-10-15 01:27:45,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:45,596 INFO L462 AbstractCegarLoop]: Abstraction has 3802 states and 5075 transitions. [2019-10-15 01:27:45,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 5075 transitions. [2019-10-15 01:27:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-15 01:27:45,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:45,613 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:45,613 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:45,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:45,614 INFO L82 PathProgramCache]: Analyzing trace with hash -121210371, now seen corresponding path program 1 times [2019-10-15 01:27:45,614 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:45,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409146649] [2019-10-15 01:27:45,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-15 01:27:45,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409146649] [2019-10-15 01:27:45,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:45,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:45,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858063604] [2019-10-15 01:27:45,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:45,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:45,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:45,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:45,822 INFO L87 Difference]: Start difference. First operand 3802 states and 5075 transitions. Second operand 3 states. [2019-10-15 01:27:46,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:46,088 INFO L93 Difference]: Finished difference Result 7992 states and 10606 transitions. [2019-10-15 01:27:46,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:46,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-10-15 01:27:46,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:46,130 INFO L225 Difference]: With dead ends: 7992 [2019-10-15 01:27:46,130 INFO L226 Difference]: Without dead ends: 4202 [2019-10-15 01:27:46,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2019-10-15 01:27:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 3922. [2019-10-15 01:27:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3922 states. [2019-10-15 01:27:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 5219 transitions. [2019-10-15 01:27:46,243 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 5219 transitions. Word has length 311 [2019-10-15 01:27:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:46,244 INFO L462 AbstractCegarLoop]: Abstraction has 3922 states and 5219 transitions. [2019-10-15 01:27:46,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 5219 transitions. [2019-10-15 01:27:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-15 01:27:46,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:46,256 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:46,256 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:46,257 INFO L82 PathProgramCache]: Analyzing trace with hash -828607418, now seen corresponding path program 1 times [2019-10-15 01:27:46,257 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:46,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734156838] [2019-10-15 01:27:46,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 706 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-10-15 01:27:46,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734156838] [2019-10-15 01:27:46,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:46,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:46,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963266927] [2019-10-15 01:27:46,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:46,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:46,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:46,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:46,464 INFO L87 Difference]: Start difference. First operand 3922 states and 5219 transitions. Second operand 3 states. [2019-10-15 01:27:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:46,597 INFO L93 Difference]: Finished difference Result 11238 states and 15033 transitions. [2019-10-15 01:27:46,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:46,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-10-15 01:27:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:46,615 INFO L225 Difference]: With dead ends: 11238 [2019-10-15 01:27:46,615 INFO L226 Difference]: Without dead ends: 7328 [2019-10-15 01:27:46,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:46,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7328 states. [2019-10-15 01:27:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7328 to 7326. [2019-10-15 01:27:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7326 states. [2019-10-15 01:27:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 9805 transitions. [2019-10-15 01:27:46,795 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 9805 transitions. Word has length 312 [2019-10-15 01:27:46,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:46,796 INFO L462 AbstractCegarLoop]: Abstraction has 7326 states and 9805 transitions. [2019-10-15 01:27:46,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 9805 transitions. [2019-10-15 01:27:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-15 01:27:46,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:46,816 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:46,817 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:46,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:46,818 INFO L82 PathProgramCache]: Analyzing trace with hash -935849662, now seen corresponding path program 1 times [2019-10-15 01:27:46,818 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:46,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762097864] [2019-10-15 01:27:46,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 710 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-10-15 01:27:46,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762097864] [2019-10-15 01:27:46,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:46,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:46,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185792371] [2019-10-15 01:27:46,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:46,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:46,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:46,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:46,950 INFO L87 Difference]: Start difference. First operand 7326 states and 9805 transitions. Second operand 3 states. [2019-10-15 01:27:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:47,166 INFO L93 Difference]: Finished difference Result 14648 states and 19586 transitions. [2019-10-15 01:27:47,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:47,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-10-15 01:27:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:47,183 INFO L225 Difference]: With dead ends: 14648 [2019-10-15 01:27:47,183 INFO L226 Difference]: Without dead ends: 7334 [2019-10-15 01:27:47,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7334 states. [2019-10-15 01:27:47,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7334 to 7302. [2019-10-15 01:27:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7302 states. [2019-10-15 01:27:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 9525 transitions. [2019-10-15 01:27:47,386 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 9525 transitions. Word has length 313 [2019-10-15 01:27:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:47,387 INFO L462 AbstractCegarLoop]: Abstraction has 7302 states and 9525 transitions. [2019-10-15 01:27:47,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 9525 transitions. [2019-10-15 01:27:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-15 01:27:47,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:47,403 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:47,403 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:47,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1555626477, now seen corresponding path program 1 times [2019-10-15 01:27:47,404 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:47,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007255659] [2019-10-15 01:27:47,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:47,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:47,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 765 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-15 01:27:47,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007255659] [2019-10-15 01:27:47,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754937096] [2019-10-15 01:27:47,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:47,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:27:47,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2019-10-15 01:27:48,170 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2019-10-15 01:27:48,453 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:27:48,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:27:48,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438947820] [2019-10-15 01:27:48,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:48,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:48,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:48,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:48,457 INFO L87 Difference]: Start difference. First operand 7302 states and 9525 transitions. Second operand 3 states. [2019-10-15 01:27:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:48,634 INFO L93 Difference]: Finished difference Result 18220 states and 23754 transitions. [2019-10-15 01:27:48,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:48,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-10-15 01:27:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:48,665 INFO L225 Difference]: With dead ends: 18220 [2019-10-15 01:27:48,665 INFO L226 Difference]: Without dead ends: 10930 [2019-10-15 01:27:48,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 671 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10930 states. [2019-10-15 01:27:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10930 to 10930. [2019-10-15 01:27:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10930 states. [2019-10-15 01:27:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10930 states to 10930 states and 14229 transitions. [2019-10-15 01:27:49,277 INFO L78 Accepts]: Start accepts. Automaton has 10930 states and 14229 transitions. Word has length 336 [2019-10-15 01:27:49,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:49,278 INFO L462 AbstractCegarLoop]: Abstraction has 10930 states and 14229 transitions. [2019-10-15 01:27:49,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 10930 states and 14229 transitions. [2019-10-15 01:27:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-10-15 01:27:49,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:49,316 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:49,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:49,525 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:49,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:49,525 INFO L82 PathProgramCache]: Analyzing trace with hash 451618901, now seen corresponding path program 1 times [2019-10-15 01:27:49,525 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:49,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541023513] [2019-10-15 01:27:49,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:49,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:49,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 767 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-15 01:27:49,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541023513] [2019-10-15 01:27:49,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680959840] [2019-10-15 01:27:49,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:49,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:27:49,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1245 trivial. 0 not checked. [2019-10-15 01:27:49,970 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1245 trivial. 0 not checked. [2019-10-15 01:27:50,184 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:27:50,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 10 [2019-10-15 01:27:50,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908374175] [2019-10-15 01:27:50,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:27:50,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:50,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:27:50,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:27:50,186 INFO L87 Difference]: Start difference. First operand 10930 states and 14229 transitions. Second operand 8 states. [2019-10-15 01:27:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:50,691 INFO L93 Difference]: Finished difference Result 22146 states and 28843 transitions. [2019-10-15 01:27:50,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:27:50,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 338 [2019-10-15 01:27:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:50,714 INFO L225 Difference]: With dead ends: 22146 [2019-10-15 01:27:50,714 INFO L226 Difference]: Without dead ends: 11200 [2019-10-15 01:27:50,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:27:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11200 states. [2019-10-15 01:27:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11200 to 10936. [2019-10-15 01:27:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10936 states. [2019-10-15 01:27:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10936 states to 10936 states and 14237 transitions. [2019-10-15 01:27:50,976 INFO L78 Accepts]: Start accepts. Automaton has 10936 states and 14237 transitions. Word has length 338 [2019-10-15 01:27:50,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:50,976 INFO L462 AbstractCegarLoop]: Abstraction has 10936 states and 14237 transitions. [2019-10-15 01:27:50,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:27:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 10936 states and 14237 transitions. [2019-10-15 01:27:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-15 01:27:50,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:51,000 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:51,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:51,205 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:51,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1817523371, now seen corresponding path program 1 times [2019-10-15 01:27:51,206 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:51,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287025297] [2019-10-15 01:27:51,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:51,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:51,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-15 01:27:51,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287025297] [2019-10-15 01:27:51,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874519798] [2019-10-15 01:27:51,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:51,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:51,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-15 01:27:51,757 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-15 01:27:51,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1009431978] [2019-10-15 01:27:51,892 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 351 [2019-10-15 01:27:51,939 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:27:51,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:27:52,089 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:27:53,671 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:27:53,675 INFO L272 AbstractInterpreter]: Visited 108 different actions 2357 times. Merged at 98 different actions 1895 times. Widened at 22 different actions 229 times. Performed 5805 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5805 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 338 fixpoints after 36 different actions. Largest state had 69 variables. [2019-10-15 01:27:53,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:53,684 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:27:53,684 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:27:53,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:27:53,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759281638] [2019-10-15 01:27:53,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:27:53,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:53,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:27:53,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:53,688 INFO L87 Difference]: Start difference. First operand 10936 states and 14237 transitions. Second operand 6 states. [2019-10-15 01:27:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:54,703 INFO L93 Difference]: Finished difference Result 21892 states and 28499 transitions. [2019-10-15 01:27:54,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:27:54,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 350 [2019-10-15 01:27:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:54,753 INFO L225 Difference]: With dead ends: 21892 [2019-10-15 01:27:54,753 INFO L226 Difference]: Without dead ends: 16552 [2019-10-15 01:27:54,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:27:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16552 states. [2019-10-15 01:27:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16552 to 12568. [2019-10-15 01:27:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12568 states. [2019-10-15 01:27:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12568 states to 12568 states and 16457 transitions. [2019-10-15 01:27:55,101 INFO L78 Accepts]: Start accepts. Automaton has 12568 states and 16457 transitions. Word has length 350 [2019-10-15 01:27:55,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:55,102 INFO L462 AbstractCegarLoop]: Abstraction has 12568 states and 16457 transitions. [2019-10-15 01:27:55,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:27:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 12568 states and 16457 transitions. [2019-10-15 01:27:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-10-15 01:27:55,126 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:55,127 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:55,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:55,332 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:55,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash -299155883, now seen corresponding path program 2 times [2019-10-15 01:27:55,333 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:55,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184060821] [2019-10-15 01:27:55,333 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,333 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:55,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-15 01:27:55,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184060821] [2019-10-15 01:27:55,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9005053] [2019-10-15 01:27:55,465 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:55,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-15 01:27:55,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:27:55,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:55,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-10-15 01:27:56,151 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-10-15 01:27:56,266 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:27:56,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:27:56,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533028202] [2019-10-15 01:27:56,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:56,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:56,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:56,271 INFO L87 Difference]: Start difference. First operand 12568 states and 16457 transitions. Second operand 3 states. [2019-10-15 01:27:56,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:56,544 INFO L93 Difference]: Finished difference Result 24326 states and 31258 transitions. [2019-10-15 01:27:56,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:56,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-10-15 01:27:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:56,568 INFO L225 Difference]: With dead ends: 24326 [2019-10-15 01:27:56,569 INFO L226 Difference]: Without dead ends: 11776 [2019-10-15 01:27:56,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:56,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11776 states. [2019-10-15 01:27:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11776 to 11416. [2019-10-15 01:27:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11416 states. [2019-10-15 01:27:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11416 states to 11416 states and 14321 transitions. [2019-10-15 01:27:56,806 INFO L78 Accepts]: Start accepts. Automaton has 11416 states and 14321 transitions. Word has length 362 [2019-10-15 01:27:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:56,807 INFO L462 AbstractCegarLoop]: Abstraction has 11416 states and 14321 transitions. [2019-10-15 01:27:56,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 11416 states and 14321 transitions. [2019-10-15 01:27:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-10-15 01:27:56,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:56,834 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:57,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:57,048 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:57,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2019228612, now seen corresponding path program 1 times [2019-10-15 01:27:57,049 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:57,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382799921] [2019-10-15 01:27:57,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-15 01:27:57,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382799921] [2019-10-15 01:27:57,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349137586] [2019-10-15 01:27:57,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:57,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:57,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-15 01:27:57,494 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-15 01:27:57,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1600760669] [2019-10-15 01:27:57,590 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 377 [2019-10-15 01:27:57,600 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:27:57,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:27:57,610 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:27:59,048 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:27:59,048 INFO L272 AbstractInterpreter]: Visited 109 different actions 2344 times. Merged at 99 different actions 1868 times. Widened at 21 different actions 223 times. Performed 5913 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5913 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 351 fixpoints after 34 different actions. Largest state had 69 variables. [2019-10-15 01:27:59,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:59,049 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:27:59,049 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:27:59,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:27:59,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248612089] [2019-10-15 01:27:59,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:27:59,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:59,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:27:59,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:59,053 INFO L87 Difference]: Start difference. First operand 11416 states and 14321 transitions. Second operand 6 states. [2019-10-15 01:27:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:59,697 INFO L93 Difference]: Finished difference Result 25352 states and 31647 transitions. [2019-10-15 01:27:59,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:59,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 376 [2019-10-15 01:27:59,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:59,727 INFO L225 Difference]: With dead ends: 25352 [2019-10-15 01:27:59,727 INFO L226 Difference]: Without dead ends: 13942 [2019-10-15 01:27:59,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:27:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13942 states. [2019-10-15 01:27:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13942 to 11694. [2019-10-15 01:27:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11694 states. [2019-10-15 01:27:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11694 states to 11694 states and 14578 transitions. [2019-10-15 01:27:59,965 INFO L78 Accepts]: Start accepts. Automaton has 11694 states and 14578 transitions. Word has length 376 [2019-10-15 01:27:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:59,966 INFO L462 AbstractCegarLoop]: Abstraction has 11694 states and 14578 transitions. [2019-10-15 01:27:59,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:27:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 11694 states and 14578 transitions. [2019-10-15 01:27:59,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-10-15 01:27:59,977 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:59,978 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:00,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:00,183 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:00,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1965718292, now seen corresponding path program 1 times [2019-10-15 01:28:00,184 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:00,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727410047] [2019-10-15 01:28:00,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-15 01:28:00,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727410047] [2019-10-15 01:28:00,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:00,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:00,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703747040] [2019-10-15 01:28:00,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:00,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:00,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:00,350 INFO L87 Difference]: Start difference. First operand 11694 states and 14578 transitions. Second operand 3 states. [2019-10-15 01:28:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:00,610 INFO L93 Difference]: Finished difference Result 22624 states and 27701 transitions. [2019-10-15 01:28:00,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:00,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 415 [2019-10-15 01:28:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:00,623 INFO L225 Difference]: With dead ends: 22624 [2019-10-15 01:28:00,624 INFO L226 Difference]: Without dead ends: 5426 [2019-10-15 01:28:00,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2019-10-15 01:28:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 5193. [2019-10-15 01:28:00,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5193 states. [2019-10-15 01:28:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 6407 transitions. [2019-10-15 01:28:00,752 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 6407 transitions. Word has length 415 [2019-10-15 01:28:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:00,753 INFO L462 AbstractCegarLoop]: Abstraction has 5193 states and 6407 transitions. [2019-10-15 01:28:00,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 6407 transitions. [2019-10-15 01:28:00,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-10-15 01:28:00,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:00,763 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:00,764 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:00,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1027355828, now seen corresponding path program 1 times [2019-10-15 01:28:00,764 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:00,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463619525] [2019-10-15 01:28:00,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-10-15 01:28:01,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463619525] [2019-10-15 01:28:01,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634462928] [2019-10-15 01:28:01,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:01,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:01,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-10-15 01:28:01,548 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-10-15 01:28:01,798 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:01,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:01,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768362298] [2019-10-15 01:28:01,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:01,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:01,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:01,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:01,800 INFO L87 Difference]: Start difference. First operand 5193 states and 6407 transitions. Second operand 3 states. [2019-10-15 01:28:01,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:01,847 INFO L93 Difference]: Finished difference Result 5268 states and 6502 transitions. [2019-10-15 01:28:01,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:01,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-10-15 01:28:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:01,857 INFO L225 Difference]: With dead ends: 5268 [2019-10-15 01:28:01,858 INFO L226 Difference]: Without dead ends: 5192 [2019-10-15 01:28:01,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1001 GetRequests, 998 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:01,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2019-10-15 01:28:01,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 5119. [2019-10-15 01:28:01,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5119 states. [2019-10-15 01:28:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5119 states to 5119 states and 6316 transitions. [2019-10-15 01:28:01,988 INFO L78 Accepts]: Start accepts. Automaton has 5119 states and 6316 transitions. Word has length 499 [2019-10-15 01:28:01,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:01,989 INFO L462 AbstractCegarLoop]: Abstraction has 5119 states and 6316 transitions. [2019-10-15 01:28:01,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:01,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5119 states and 6316 transitions. [2019-10-15 01:28:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-10-15 01:28:01,998 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:01,999 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 01:28:02,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:02,212 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:02,213 INFO L82 PathProgramCache]: Analyzing trace with hash -241116614, now seen corresponding path program 1 times [2019-10-15 01:28:02,213 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:02,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500916499] [2019-10-15 01:28:02,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:02,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:02,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-10-15 01:28:02,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500916499] [2019-10-15 01:28:02,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263724281] [2019-10-15 01:28:02,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:02,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:02,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-10-15 01:28:02,960 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-10-15 01:28:03,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1738114952] [2019-10-15 01:28:03,176 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 610 [2019-10-15 01:28:03,180 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:03,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:03,186 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:04,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:04,329 INFO L272 AbstractInterpreter]: Visited 112 different actions 2220 times. Merged at 98 different actions 1802 times. Widened at 20 different actions 240 times. Performed 5590 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5590 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 286 fixpoints after 34 different actions. Largest state had 70 variables. [2019-10-15 01:28:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:04,330 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:04,330 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:04,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:04,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756576958] [2019-10-15 01:28:04,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:04,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:04,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:04,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:04,338 INFO L87 Difference]: Start difference. First operand 5119 states and 6316 transitions. Second operand 6 states. [2019-10-15 01:28:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:04,577 INFO L93 Difference]: Finished difference Result 5622 states and 6950 transitions. [2019-10-15 01:28:04,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:04,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 609 [2019-10-15 01:28:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:04,578 INFO L225 Difference]: With dead ends: 5622 [2019-10-15 01:28:04,579 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:28:04,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1225 GetRequests, 1219 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:28:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:28:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:28:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:28:04,588 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 609 [2019-10-15 01:28:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:04,588 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:28:04,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:28:04,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:28:04,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:04,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:28:05,750 WARN L191 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 610 DAG size of output: 138 [2019-10-15 01:28:06,307 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 29