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_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:27:36,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:27:36,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:27:36,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:27:36,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:27:36,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:27:36,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:27:36,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:27:36,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:27:36,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:27:36,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:27:36,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:27:36,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:27:36,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:27:36,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:27:36,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:27:36,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:27:36,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:27:36,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:27:36,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:27:36,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:27:36,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:27:36,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:27:36,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:27:36,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:27:36,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:27:36,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:27:36,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:27:36,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:27:36,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:27:36,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:27:36,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:27:36,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:27:36,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:27:36,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:27:36,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:27:36,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:27:36,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:27:36,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:27:36,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:27:36,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:27:36,393 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,408 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:27:36,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:27:36,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:27:36,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:27:36,410 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:27:36,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:27:36,410 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:27:36,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:27:36,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:27:36,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:27:36,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:27:36,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:27:36,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:27:36,411 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:27:36,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:27:36,412 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:27:36,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:27:36,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:27:36,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:27:36,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:27:36,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:27:36,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:36,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:27:36,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:27:36,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:27:36,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:27:36,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:27:36,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:27:36,416 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,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:27:36,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:27:36,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:27:36,707 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:27:36,708 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:27:36,709 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-10-15 01:27:36,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e9924f25/39a9eb415b9646b1b5d5a1738005895e/FLAG2997cb180 [2019-10-15 01:27:37,309 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:27:37,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-10-15 01:27:37,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e9924f25/39a9eb415b9646b1b5d5a1738005895e/FLAG2997cb180 [2019-10-15 01:27:37,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e9924f25/39a9eb415b9646b1b5d5a1738005895e [2019-10-15 01:27:37,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:27:37,656 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:27:37,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:37,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:27:37,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:27:37,664 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,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5a0fe7 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,668 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,677 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:27:37,737 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:27:37,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:37,989 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:27:38,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:38,153 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:27:38,153 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,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:38,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:27:38,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:27:38,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:27:38,165 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,166 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,174 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,174 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,186 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,199 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,207 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,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:27:38,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:27:38,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:27:38,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:27:38,213 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,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:27:38,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:27:38,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-15 01:27:38,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:27:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:27:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:27:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:27:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:27:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:27:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-15 01:27:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:27:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:27:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:27:38,519 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:27:39,000 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-15 01:27:39,001 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-15 01:27:39,015 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:27:39,015 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:27:39,017 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,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:27:39,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:27:39,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:27:39,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:27:39,022 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,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8e495c 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,023 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,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8e495c 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,024 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,026 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2019-10-15 01:27:39,036 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:27:39,045 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:27:39,058 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:27:39,093 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:27:39,093 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:27:39,094 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:27:39,094 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:27:39,094 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:27:39,095 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:27:39,095 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:27:39,095 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:27:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-10-15 01:27:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:27:39,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:39,131 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,133 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:39,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:39,139 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-10-15 01:27:39,148 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:39,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302823644] [2019-10-15 01:27:39,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:39,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:39,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:39,395 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,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302823644] [2019-10-15 01:27:39,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:39,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:39,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869293294] [2019-10-15 01:27:39,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:39,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:39,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:39,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:39,424 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-10-15 01:27:39,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:39,542 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-10-15 01:27:39,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:39,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:27:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:39,559 INFO L225 Difference]: With dead ends: 377 [2019-10-15 01:27:39,559 INFO L226 Difference]: Without dead ends: 220 [2019-10-15 01:27:39,564 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,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-15 01:27:39,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-10-15 01:27:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 01:27:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-10-15 01:27:39,633 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-10-15 01:27:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:39,634 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-10-15 01:27:39,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:39,635 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-10-15 01:27:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:27:39,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:39,638 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:39,639 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:39,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:39,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1426924635, now seen corresponding path program 1 times [2019-10-15 01:27:39,639 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:39,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157296473] [2019-10-15 01:27:39,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:39,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:39,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:39,762 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:39,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157296473] [2019-10-15 01:27:39,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:39,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:39,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418825920] [2019-10-15 01:27:39,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:39,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:39,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:39,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:39,767 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-10-15 01:27:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:40,001 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2019-10-15 01:27:40,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:40,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-15 01:27:40,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:40,011 INFO L225 Difference]: With dead ends: 470 [2019-10-15 01:27:40,012 INFO L226 Difference]: Without dead ends: 262 [2019-10-15 01:27:40,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-15 01:27:40,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2019-10-15 01:27:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-15 01:27:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-10-15 01:27:40,068 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-10-15 01:27:40,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:40,069 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-10-15 01:27:40,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:40,069 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-10-15 01:27:40,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:27:40,074 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:40,075 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,075 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:40,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:40,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1669760968, now seen corresponding path program 1 times [2019-10-15 01:27:40,076 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:40,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648340997] [2019-10-15 01:27:40,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:40,162 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,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648340997] [2019-10-15 01:27:40,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:40,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:40,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38684169] [2019-10-15 01:27:40,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:40,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:40,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:40,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,172 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-10-15 01:27:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:40,414 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-10-15 01:27:40,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:40,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:27:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:40,419 INFO L225 Difference]: With dead ends: 598 [2019-10-15 01:27:40,419 INFO L226 Difference]: Without dead ends: 354 [2019-10-15 01:27:40,423 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,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-15 01:27:40,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-10-15 01:27:40,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-15 01:27:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-10-15 01:27:40,442 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-10-15 01:27:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:40,443 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-10-15 01:27:40,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-10-15 01:27:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:27:40,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:40,447 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,447 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:40,448 INFO L82 PathProgramCache]: Analyzing trace with hash 819767994, now seen corresponding path program 1 times [2019-10-15 01:27:40,448 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:40,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376459279] [2019-10-15 01:27:40,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:40,559 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,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376459279] [2019-10-15 01:27:40,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:40,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:40,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644987870] [2019-10-15 01:27:40,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:40,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:40,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:40,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,561 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-10-15 01:27:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:40,742 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2019-10-15 01:27:40,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:40,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:27:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:40,749 INFO L225 Difference]: With dead ends: 708 [2019-10-15 01:27:40,749 INFO L226 Difference]: Without dead ends: 384 [2019-10-15 01:27:40,751 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,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-10-15 01:27:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2019-10-15 01:27:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-15 01:27:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-10-15 01:27:40,786 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-10-15 01:27:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:40,787 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-10-15 01:27:40,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-10-15 01:27:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 01:27:40,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:40,792 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, 1] [2019-10-15 01:27:40,792 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:40,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:40,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1719879938, now seen corresponding path program 1 times [2019-10-15 01:27:40,793 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:40,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977637880] [2019-10-15 01:27:40,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:40,871 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:40,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977637880] [2019-10-15 01:27:40,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:40,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:40,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374351236] [2019-10-15 01:27:40,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:40,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:40,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:40,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,876 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-10-15 01:27:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,117 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-10-15 01:27:41,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-15 01:27:41,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,123 INFO L225 Difference]: With dead ends: 842 [2019-10-15 01:27:41,123 INFO L226 Difference]: Without dead ends: 478 [2019-10-15 01:27:41,125 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,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-15 01:27:41,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-10-15 01:27:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-15 01:27:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-10-15 01:27:41,149 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-10-15 01:27:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,149 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-10-15 01:27:41,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-10-15 01:27:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:27:41,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,154 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, 1] [2019-10-15 01:27:41,154 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1093696729, now seen corresponding path program 1 times [2019-10-15 01:27:41,155 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149015751] [2019-10-15 01:27:41,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,239 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,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149015751] [2019-10-15 01:27:41,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655936580] [2019-10-15 01:27:41,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,243 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-10-15 01:27:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,387 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-10-15 01:27:41,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-15 01:27:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,391 INFO L225 Difference]: With dead ends: 940 [2019-10-15 01:27:41,391 INFO L226 Difference]: Without dead ends: 500 [2019-10-15 01:27:41,393 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,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-15 01:27:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-10-15 01:27:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-15 01:27:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-10-15 01:27:41,410 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-10-15 01:27:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,410 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-10-15 01:27:41,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-10-15 01:27:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:27:41,412 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,413 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] [2019-10-15 01:27:41,413 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1180839903, now seen corresponding path program 1 times [2019-10-15 01:27:41,414 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394162737] [2019-10-15 01:27:41,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,499 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,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394162737] [2019-10-15 01:27:41,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077661382] [2019-10-15 01:27:41,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,502 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-10-15 01:27:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,545 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-10-15 01:27:41,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-15 01:27:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,551 INFO L225 Difference]: With dead ends: 976 [2019-10-15 01:27:41,551 INFO L226 Difference]: Without dead ends: 734 [2019-10-15 01:27:41,552 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,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-15 01:27:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-10-15 01:27:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-10-15 01:27:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-10-15 01:27:41,577 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-10-15 01:27:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,578 INFO L462 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-10-15 01:27:41,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-10-15 01:27:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:27:41,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,581 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, 1] [2019-10-15 01:27:41,582 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,582 INFO L82 PathProgramCache]: Analyzing trace with hash 866854985, now seen corresponding path program 1 times [2019-10-15 01:27:41,582 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133282984] [2019-10-15 01:27:41,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,693 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,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133282984] [2019-10-15 01:27:41,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378416016] [2019-10-15 01:27:41,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,695 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-10-15 01:27:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,740 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-10-15 01:27:41,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-15 01:27:41,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,747 INFO L225 Difference]: With dead ends: 976 [2019-10-15 01:27:41,747 INFO L226 Difference]: Without dead ends: 974 [2019-10-15 01:27:41,749 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,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-10-15 01:27:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-10-15 01:27:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-10-15 01:27:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-10-15 01:27:41,780 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-10-15 01:27:41,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,781 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-10-15 01:27:41,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-10-15 01:27:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-15 01:27:41,785 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,785 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:41,786 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,786 INFO L82 PathProgramCache]: Analyzing trace with hash -394036509, now seen corresponding path program 1 times [2019-10-15 01:27:41,786 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22667498] [2019-10-15 01:27:41,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-15 01:27:41,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22667498] [2019-10-15 01:27:41,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641078509] [2019-10-15 01:27:41,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,862 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-10-15 01:27:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,037 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-10-15 01:27:42,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-15 01:27:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,044 INFO L225 Difference]: With dead ends: 2140 [2019-10-15 01:27:42,045 INFO L226 Difference]: Without dead ends: 1170 [2019-10-15 01:27:42,047 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,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-10-15 01:27:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-10-15 01:27:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-10-15 01:27:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-10-15 01:27:42,083 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 168 [2019-10-15 01:27:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,083 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-10-15 01:27:42,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-10-15 01:27:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-15 01:27:42,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,088 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:42,089 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,089 INFO L82 PathProgramCache]: Analyzing trace with hash 531653490, now seen corresponding path program 1 times [2019-10-15 01:27:42,089 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851239334] [2019-10-15 01:27:42,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-10-15 01:27:42,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851239334] [2019-10-15 01:27:42,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487904970] [2019-10-15 01:27:42,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,201 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-10-15 01:27:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,351 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-10-15 01:27:42,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-15 01:27:42,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,359 INFO L225 Difference]: With dead ends: 2354 [2019-10-15 01:27:42,359 INFO L226 Difference]: Without dead ends: 1236 [2019-10-15 01:27:42,367 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,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-10-15 01:27:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-10-15 01:27:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-10-15 01:27:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-10-15 01:27:42,407 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 204 [2019-10-15 01:27:42,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,407 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-10-15 01:27:42,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-10-15 01:27:42,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-15 01:27:42,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,413 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,413 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash -354539531, now seen corresponding path program 1 times [2019-10-15 01:27:42,414 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896907391] [2019-10-15 01:27:42,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-10-15 01:27:42,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896907391] [2019-10-15 01:27:42,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734991973] [2019-10-15 01:27:42,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,521 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-10-15 01:27:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,693 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-10-15 01:27:42,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-10-15 01:27:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,701 INFO L225 Difference]: With dead ends: 2544 [2019-10-15 01:27:42,702 INFO L226 Difference]: Without dead ends: 1334 [2019-10-15 01:27:42,705 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,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-10-15 01:27:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-10-15 01:27:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-10-15 01:27:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-10-15 01:27:42,751 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 225 [2019-10-15 01:27:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,752 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-10-15 01:27:42,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-10-15 01:27:42,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-15 01:27:42,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,761 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,762 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1874601560, now seen corresponding path program 1 times [2019-10-15 01:27:42,762 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252861503] [2019-10-15 01:27:42,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-15 01:27:42,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252861503] [2019-10-15 01:27:42,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828187270] [2019-10-15 01:27:42,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,863 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 1322 states and 1864 transitions. Second operand 3 states. [2019-10-15 01:27:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,002 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-10-15 01:27:43,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:43,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-10-15 01:27:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,011 INFO L225 Difference]: With dead ends: 2752 [2019-10-15 01:27:43,011 INFO L226 Difference]: Without dead ends: 1442 [2019-10-15 01:27:43,014 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,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-10-15 01:27:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-10-15 01:27:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-10-15 01:27:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-10-15 01:27:43,052 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 249 [2019-10-15 01:27:43,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:43,053 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-10-15 01:27:43,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-10-15 01:27:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-15 01:27:43,058 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:43,059 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,059 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:43,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:43,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1835594086, now seen corresponding path program 1 times [2019-10-15 01:27:43,060 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:43,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28945223] [2019-10-15 01:27:43,060 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,060 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-15 01:27:43,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28945223] [2019-10-15 01:27:43,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:43,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:43,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758847670] [2019-10-15 01:27:43,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:43,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:43,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,204 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-10-15 01:27:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,339 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-10-15 01:27:43,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:43,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-10-15 01:27:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,347 INFO L225 Difference]: With dead ends: 2992 [2019-10-15 01:27:43,347 INFO L226 Difference]: Without dead ends: 1570 [2019-10-15 01:27:43,350 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,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-10-15 01:27:43,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-10-15 01:27:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-10-15 01:27:43,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-10-15 01:27:43,391 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 249 [2019-10-15 01:27:43,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:43,392 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-10-15 01:27:43,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:43,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-10-15 01:27:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-15 01:27:43,398 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:43,398 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 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] [2019-10-15 01:27:43,398 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:43,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:43,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1915187928, now seen corresponding path program 1 times [2019-10-15 01:27:43,399 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:43,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158218334] [2019-10-15 01:27:43,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2019-10-15 01:27:43,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158218334] [2019-10-15 01:27:43,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:43,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:43,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031379087] [2019-10-15 01:27:43,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:43,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:43,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,550 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-10-15 01:27:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,602 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-10-15 01:27:43,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:43,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-10-15 01:27:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,617 INFO L225 Difference]: With dead ends: 4646 [2019-10-15 01:27:43,617 INFO L226 Difference]: Without dead ends: 3100 [2019-10-15 01:27:43,622 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,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-10-15 01:27:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-10-15 01:27:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-10-15 01:27:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-10-15 01:27:43,702 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 279 [2019-10-15 01:27:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:43,703 INFO L462 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-10-15 01:27:43,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-10-15 01:27:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-15 01:27:43,712 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:43,712 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 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] [2019-10-15 01:27:43,713 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:43,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1795007718, now seen corresponding path program 1 times [2019-10-15 01:27:43,713 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:43,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926329962] [2019-10-15 01:27:43,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-10-15 01:27:43,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926329962] [2019-10-15 01:27:43,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:43,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:43,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826509123] [2019-10-15 01:27:43,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:43,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:43,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,832 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-10-15 01:27:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:44,003 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-10-15 01:27:44,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:44,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-10-15 01:27:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:44,021 INFO L225 Difference]: With dead ends: 6484 [2019-10-15 01:27:44,021 INFO L226 Difference]: Without dead ends: 3398 [2019-10-15 01:27:44,029 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,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-10-15 01:27:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-10-15 01:27:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-10-15 01:27:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-10-15 01:27:44,151 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 279 [2019-10-15 01:27:44,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:44,152 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-10-15 01:27:44,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-10-15 01:27:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-15 01:27:44,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:44,162 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 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, 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,163 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:44,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1052232894, now seen corresponding path program 1 times [2019-10-15 01:27:44,163 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:44,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160364156] [2019-10-15 01:27:44,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2019-10-15 01:27:44,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160364156] [2019-10-15 01:27:44,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:44,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:44,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027341464] [2019-10-15 01:27:44,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:44,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:44,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:44,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,302 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-10-15 01:27:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:44,480 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-10-15 01:27:44,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:44,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-10-15 01:27:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:44,498 INFO L225 Difference]: With dead ends: 6900 [2019-10-15 01:27:44,498 INFO L226 Difference]: Without dead ends: 3530 [2019-10-15 01:27:44,506 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,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-10-15 01:27:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-10-15 01:27:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-10-15 01:27:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-10-15 01:27:44,608 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 303 [2019-10-15 01:27:44,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:44,609 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-10-15 01:27:44,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-10-15 01:27:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-15 01:27:44,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:44,621 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 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, 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] [2019-10-15 01:27:44,621 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:44,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:44,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1022376132, now seen corresponding path program 1 times [2019-10-15 01:27:44,622 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:44,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975173834] [2019-10-15 01:27:44,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-15 01:27:44,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975173834] [2019-10-15 01:27:44,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:44,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:44,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663890573] [2019-10-15 01:27:44,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:44,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:44,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:44,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,864 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-10-15 01:27:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:45,091 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-10-15 01:27:45,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:45,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-10-15 01:27:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:45,110 INFO L225 Difference]: With dead ends: 7416 [2019-10-15 01:27:45,110 INFO L226 Difference]: Without dead ends: 3914 [2019-10-15 01:27:45,118 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,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-10-15 01:27:45,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-10-15 01:27:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-10-15 01:27:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-10-15 01:27:45,221 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 314 [2019-10-15 01:27:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:45,222 INFO L462 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-10-15 01:27:45,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-10-15 01:27:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-15 01:27:45,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:45,235 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 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, 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:45,235 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:45,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:45,236 INFO L82 PathProgramCache]: Analyzing trace with hash -773017638, now seen corresponding path program 1 times [2019-10-15 01:27:45,236 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:45,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823051276] [2019-10-15 01:27:45,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-10-15 01:27:45,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823051276] [2019-10-15 01:27:45,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:45,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:45,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581296213] [2019-10-15 01:27:45,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:45,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:45,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:45,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:45,385 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-10-15 01:27:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:45,605 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-10-15 01:27:45,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:45,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-10-15 01:27:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:45,626 INFO L225 Difference]: With dead ends: 8048 [2019-10-15 01:27:45,627 INFO L226 Difference]: Without dead ends: 4234 [2019-10-15 01:27:45,634 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,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-10-15 01:27:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-10-15 01:27:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-10-15 01:27:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-10-15 01:27:45,738 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 328 [2019-10-15 01:27:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:45,739 INFO L462 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-10-15 01:27:45,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-10-15 01:27:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-15 01:27:45,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:45,752 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 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, 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:27:45,752 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:45,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:45,752 INFO L82 PathProgramCache]: Analyzing trace with hash -815480887, now seen corresponding path program 1 times [2019-10-15 01:27:45,753 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:45,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276173513] [2019-10-15 01:27:45,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-10-15 01:27:45,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276173513] [2019-10-15 01:27:45,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:45,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:45,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475898036] [2019-10-15 01:27:45,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:45,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:45,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:45,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:45,933 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-10-15 01:27:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:46,031 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-10-15 01:27:46,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:46,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-10-15 01:27:46,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:46,052 INFO L225 Difference]: With dead ends: 11310 [2019-10-15 01:27:46,052 INFO L226 Difference]: Without dead ends: 7376 [2019-10-15 01:27:46,064 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,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-10-15 01:27:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-10-15 01:27:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-10-15 01:27:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-10-15 01:27:46,325 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 329 [2019-10-15 01:27:46,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:46,326 INFO L462 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-10-15 01:27:46,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-10-15 01:27:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-10-15 01:27:46,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:46,341 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 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, 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:46,342 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:46,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:46,342 INFO L82 PathProgramCache]: Analyzing trace with hash 415461791, now seen corresponding path program 1 times [2019-10-15 01:27:46,342 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:46,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921980327] [2019-10-15 01:27:46,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-10-15 01:27:46,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921980327] [2019-10-15 01:27:46,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:46,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:46,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732710351] [2019-10-15 01:27:46,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:46,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:46,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:46,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:46,457 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-10-15 01:27:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:46,761 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-10-15 01:27:46,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:46,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-10-15 01:27:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:46,789 INFO L225 Difference]: With dead ends: 14744 [2019-10-15 01:27:46,790 INFO L226 Difference]: Without dead ends: 7382 [2019-10-15 01:27:46,810 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,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-10-15 01:27:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-10-15 01:27:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-10-15 01:27:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-10-15 01:27:47,033 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 330 [2019-10-15 01:27:47,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:47,034 INFO L462 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-10-15 01:27:47,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-10-15 01:27:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-15 01:27:47,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:47,053 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,054 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:47,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:47,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1238161908, now seen corresponding path program 1 times [2019-10-15 01:27:47,055 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:47,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751255045] [2019-10-15 01:27:47,055 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:47,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:47,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 874 proven. 10 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-15 01:27:47,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751255045] [2019-10-15 01:27:47,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548777309] [2019-10-15 01:27:47,394 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,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:47,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:27:47,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-10-15 01:27:47,805 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-10-15 01:27:48,039 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:27:48,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 10 [2019-10-15 01:27:48,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746569619] [2019-10-15 01:27:48,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:27:48,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:48,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:27:48,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:27:48,043 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 8 states. [2019-10-15 01:27:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:48,659 INFO L93 Difference]: Finished difference Result 14930 states and 19459 transitions. [2019-10-15 01:27:48,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:27:48,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 353 [2019-10-15 01:27:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:48,678 INFO L225 Difference]: With dead ends: 14930 [2019-10-15 01:27:48,678 INFO L226 Difference]: Without dead ends: 7564 [2019-10-15 01:27:48,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:27:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2019-10-15 01:27:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 7356. [2019-10-15 01:27:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2019-10-15 01:27:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2019-10-15 01:27:48,883 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 353 [2019-10-15 01:27:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:48,883 INFO L462 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2019-10-15 01:27:48,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:27:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2019-10-15 01:27:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-10-15 01:27:48,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:48,902 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:49,109 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:49,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:49,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1456365214, now seen corresponding path program 1 times [2019-10-15 01:27:49,109 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:49,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987171991] [2019-10-15 01:27:49,110 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:49,110 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:49,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-15 01:27:49,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987171991] [2019-10-15 01:27:49,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083530428] [2019-10-15 01:27:49,322 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,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:49,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:49,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-15 01:27:49,809 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-15 01:27:50,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [878512160] [2019-10-15 01:27:50,025 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 367 [2019-10-15 01:27:50,133 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:27:50,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:27:50,530 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:27:54,307 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:27:54,311 INFO L272 AbstractInterpreter]: Visited 112 different actions 2522 times. Merged at 101 different actions 2022 times. Widened at 22 different actions 240 times. Performed 6461 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6461 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 367 fixpoints after 40 different actions. Largest state had 105 variables. [2019-10-15 01:27:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:54,319 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:27:54,319 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:27:54,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:27:54,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065179657] [2019-10-15 01:27:54,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:27:54,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:54,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:27:54,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:54,323 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 6 states. [2019-10-15 01:27:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:55,125 INFO L93 Difference]: Finished difference Result 14720 states and 19175 transitions. [2019-10-15 01:27:55,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:27:55,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 366 [2019-10-15 01:27:55,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:55,159 INFO L225 Difference]: With dead ends: 14720 [2019-10-15 01:27:55,159 INFO L226 Difference]: Without dead ends: 11130 [2019-10-15 01:27:55,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 733 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:55,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11130 states. [2019-10-15 01:27:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11130 to 8460. [2019-10-15 01:27:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-10-15 01:27:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-10-15 01:27:55,495 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 366 [2019-10-15 01:27:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:55,496 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-10-15 01:27:55,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:27:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-10-15 01:27:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-15 01:27:55,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:55,529 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, 1, 1, 1] [2019-10-15 01:27:55,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:55,744 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1345653892, now seen corresponding path program 2 times [2019-10-15 01:27:55,747 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:55,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772735012] [2019-10-15 01:27:55,747 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,747 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,026 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:56,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772735012] [2019-10-15 01:27:56,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944942157] [2019-10-15 01:27:56,027 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 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:56,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-15 01:27:56,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:27:56,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:56,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:56,422 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:56,423 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:56,529 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:56,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2108589685] [2019-10-15 01:27:56,530 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-15 01:27:56,530 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-15 01:27:56,530 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:27:56,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:27:56,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188635093] [2019-10-15 01:27:56,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:27:56,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:27:56,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:56,532 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 6 states. [2019-10-15 01:27:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:57,081 INFO L93 Difference]: Finished difference Result 19118 states and 24882 transitions. [2019-10-15 01:27:57,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:57,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 379 [2019-10-15 01:27:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:57,105 INFO L225 Difference]: With dead ends: 19118 [2019-10-15 01:27:57,105 INFO L226 Difference]: Without dead ends: 10668 [2019-10-15 01:27:57,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 758 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:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2019-10-15 01:27:57,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 8518. [2019-10-15 01:27:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2019-10-15 01:27:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 10888 transitions. [2019-10-15 01:27:57,363 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 10888 transitions. Word has length 379 [2019-10-15 01:27:57,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:57,364 INFO L462 AbstractCegarLoop]: Abstraction has 8518 states and 10888 transitions. [2019-10-15 01:27:57,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:27:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 10888 transitions. [2019-10-15 01:27:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-10-15 01:27:57,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:57,387 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, 1, 1, 1] [2019-10-15 01:27:57,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:57,593 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:57,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:57,594 INFO L82 PathProgramCache]: Analyzing trace with hash -391768364, now seen corresponding path program 1 times [2019-10-15 01:27:57,595 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:57,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41184975] [2019-10-15 01:27:57,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:57,895 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:27:57,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41184975] [2019-10-15 01:27:57,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:57,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:57,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84816154] [2019-10-15 01:27:57,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:57,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:57,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:57,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:57,902 INFO L87 Difference]: Start difference. First operand 8518 states and 10888 transitions. Second operand 3 states. [2019-10-15 01:27:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:58,228 INFO L93 Difference]: Finished difference Result 15876 states and 19733 transitions. [2019-10-15 01:27:58,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:58,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-10-15 01:27:58,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:58,241 INFO L225 Difference]: With dead ends: 15876 [2019-10-15 01:27:58,242 INFO L226 Difference]: Without dead ends: 3820 [2019-10-15 01:27:58,275 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:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2019-10-15 01:27:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3610. [2019-10-15 01:27:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3610 states. [2019-10-15 01:27:58,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4508 transitions. [2019-10-15 01:27:58,386 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 4508 transitions. Word has length 418 [2019-10-15 01:27:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:58,387 INFO L462 AbstractCegarLoop]: Abstraction has 3610 states and 4508 transitions. [2019-10-15 01:27:58,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 4508 transitions. [2019-10-15 01:27:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-10-15 01:27:58,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:58,419 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 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, 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:58,419 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:58,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1077932443, now seen corresponding path program 1 times [2019-10-15 01:27:58,420 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:58,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248529283] [2019-10-15 01:27:58,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:58,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-10-15 01:27:58,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248529283] [2019-10-15 01:27:58,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893254912] [2019-10-15 01:27:58,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:59,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:59,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-10-15 01:28:00,020 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-10-15 01:28:00,317 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:00,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:00,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877064789] [2019-10-15 01:28:00,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:00,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:00,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:00,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:00,320 INFO L87 Difference]: Start difference. First operand 3610 states and 4508 transitions. Second operand 3 states. [2019-10-15 01:28:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:00,368 INFO L93 Difference]: Finished difference Result 4045 states and 5016 transitions. [2019-10-15 01:28:00,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:00,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 516 [2019-10-15 01:28:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:00,377 INFO L225 Difference]: With dead ends: 4045 [2019-10-15 01:28:00,378 INFO L226 Difference]: Without dead ends: 3968 [2019-10-15 01:28:00,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 1032 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:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2019-10-15 01:28:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3535. [2019-10-15 01:28:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3535 states. [2019-10-15 01:28:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 4415 transitions. [2019-10-15 01:28:00,447 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 4415 transitions. Word has length 516 [2019-10-15 01:28:00,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:00,448 INFO L462 AbstractCegarLoop]: Abstraction has 3535 states and 4415 transitions. [2019-10-15 01:28:00,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 4415 transitions. [2019-10-15 01:28:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2019-10-15 01:28:00,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:00,459 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:00,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:00,664 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:00,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1541123714, now seen corresponding path program 1 times [2019-10-15 01:28:00,664 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:00,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547827358] [2019-10-15 01:28:00,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-10-15 01:28:01,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547827358] [2019-10-15 01:28:01,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050637679] [2019-10-15 01:28:01,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:01,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 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,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-10-15 01:28:01,481 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-10-15 01:28:01,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [511410052] [2019-10-15 01:28:01,723 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 629 [2019-10-15 01:28:01,734 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:01,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:01,793 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:03,284 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:03,284 INFO L272 AbstractInterpreter]: Visited 116 different actions 2215 times. Merged at 101 different actions 1800 times. Widened at 20 different actions 219 times. Performed 5850 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5850 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 294 fixpoints after 26 different actions. Largest state had 106 variables. [2019-10-15 01:28:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:03,285 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:03,285 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:03,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:03,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931718200] [2019-10-15 01:28:03,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:03,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:03,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:03,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:03,288 INFO L87 Difference]: Start difference. First operand 3535 states and 4415 transitions. Second operand 6 states. [2019-10-15 01:28:03,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:03,634 INFO L93 Difference]: Finished difference Result 4407 states and 5498 transitions. [2019-10-15 01:28:03,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:03,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 628 [2019-10-15 01:28:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:03,636 INFO L225 Difference]: With dead ends: 4407 [2019-10-15 01:28:03,636 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:28:03,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1263 GetRequests, 1257 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:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:28:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:28:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:28:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:28:03,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 628 [2019-10-15 01:28:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:03,642 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:28:03,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:28:03,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:28:03,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:03,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:28:04,035 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 50 [2019-10-15 01:28:05,165 WARN L191 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 458 DAG size of output: 98 [2019-10-15 01:28:05,359 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2019-10-15 01:28:05,800 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 19 [2019-10-15 01:28:06,221 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-10-15 01:28:06,378 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-10-15 01:28:06,964 WARN L191 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73