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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:08:14,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:08:14,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:08:14,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:08:14,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:08:14,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:08:14,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:08:14,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:08:14,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:08:14,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:08:14,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:08:14,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:08:14,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:08:14,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:08:14,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:08:14,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:08:14,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:08:14,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:08:14,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:08:14,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:08:14,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:08:14,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:08:14,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:08:14,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:08:14,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:08:14,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:08:14,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:08:14,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:08:14,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:08:14,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:08:14,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:08:14,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:08:14,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:08:14,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:08:14,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:08:14,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:08:14,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:08:14,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:08:14,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:08:14,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:08:14,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:08:14,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 04:08:14,131 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:08:14,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:08:14,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:08:14,132 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:08:14,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:08:14,133 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:08:14,133 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:08:14,133 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:08:14,133 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:08:14,134 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:08:14,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:08:14,135 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:08:14,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:08:14,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:08:14,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:08:14,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:08:14,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:08:14,136 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:08:14,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:08:14,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:08:14,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:08:14,137 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:08:14,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:08:14,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:08:14,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:08:14,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:08:14,138 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:08:14,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:08:14,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:08:14,138 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:08:14,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:08:14,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:08:14,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:08:14,184 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:08:14,185 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:08:14,185 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-10-03 04:08:14,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1445600df/8df8c171f2484e60a18f6287ac7b256b/FLAG1392b04de [2019-10-03 04:08:14,744 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:08:14,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-10-03 04:08:14,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1445600df/8df8c171f2484e60a18f6287ac7b256b/FLAG1392b04de [2019-10-03 04:08:15,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1445600df/8df8c171f2484e60a18f6287ac7b256b [2019-10-03 04:08:15,041 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:08:15,043 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:08:15,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:08:15,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:08:15,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:08:15,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:08:15" (1/1) ... [2019-10-03 04:08:15,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca28fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:15, skipping insertion in model container [2019-10-03 04:08:15,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:08:15" (1/1) ... [2019-10-03 04:08:15,061 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:08:15,102 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:08:15,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:08:15,491 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:08:15,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:08:15,562 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:08:15,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:15 WrapperNode [2019-10-03 04:08:15,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:08:15,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:08:15,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:08:15,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:08:15,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:15" (1/1) ... [2019-10-03 04:08:15,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:15" (1/1) ... [2019-10-03 04:08:15,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:15" (1/1) ... [2019-10-03 04:08:15,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:15" (1/1) ... [2019-10-03 04:08:15,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:15" (1/1) ... [2019-10-03 04:08:15,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:15" (1/1) ... [2019-10-03 04:08:15,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:15" (1/1) ... [2019-10-03 04:08:15,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:08:15,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:08:15,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:08:15,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:08:15,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:15" (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-03 04:08:15,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:08:15,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:08:15,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-03 04:08:15,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:08:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:08:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 04:08:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:08:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 04:08:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 04:08:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-03 04:08:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:08:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:08:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:08:15,923 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 04:08:16,433 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-03 04:08:16,433 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-03 04:08:16,447 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:08:16,447 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 04:08:16,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:08:16 BoogieIcfgContainer [2019-10-03 04:08:16,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:08:16,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:08:16,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:08:16,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:08:16,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:08:15" (1/3) ... [2019-10-03 04:08:16,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4ef5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:08:16, skipping insertion in model container [2019-10-03 04:08:16,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:15" (2/3) ... [2019-10-03 04:08:16,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4ef5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:08:16, skipping insertion in model container [2019-10-03 04:08:16,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:08:16" (3/3) ... [2019-10-03 04:08:16,459 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-10-03 04:08:16,470 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:08:16,479 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:08:16,498 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:08:16,528 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:08:16,528 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:08:16,529 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:08:16,529 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:08:16,529 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:08:16,529 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:08:16,529 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:08:16,530 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:08:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-10-03 04:08:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 04:08:16,565 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:16,566 INFO L411 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-03 04:08:16,568 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:16,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:16,574 INFO L82 PathProgramCache]: Analyzing trace with hash 173381458, now seen corresponding path program 1 times [2019-10-03 04:08:16,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:16,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:16,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:16,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:16,801 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-03 04:08:16,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:16,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:16,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:16,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:16,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:16,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:16,831 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2019-10-03 04:08:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:16,969 INFO L93 Difference]: Finished difference Result 251 states and 414 transitions. [2019-10-03 04:08:16,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:16,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 04:08:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:16,987 INFO L225 Difference]: With dead ends: 251 [2019-10-03 04:08:16,987 INFO L226 Difference]: Without dead ends: 218 [2019-10-03 04:08:16,989 INFO L640 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-03 04:08:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-03 04:08:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-10-03 04:08:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-10-03 04:08:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 324 transitions. [2019-10-03 04:08:17,051 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 324 transitions. Word has length 29 [2019-10-03 04:08:17,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:17,052 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 324 transitions. [2019-10-03 04:08:17,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:17,052 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 324 transitions. [2019-10-03 04:08:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-03 04:08:17,055 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:17,055 INFO L411 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-03 04:08:17,056 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:17,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1098410427, now seen corresponding path program 1 times [2019-10-03 04:08:17,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:17,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:17,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:17,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:17,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:17,151 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-03 04:08:17,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:17,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:17,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:17,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:17,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:17,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:17,156 INFO L87 Difference]: Start difference. First operand 218 states and 324 transitions. Second operand 3 states. [2019-10-03 04:08:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:17,365 INFO L93 Difference]: Finished difference Result 260 states and 379 transitions. [2019-10-03 04:08:17,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:17,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-03 04:08:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:17,369 INFO L225 Difference]: With dead ends: 260 [2019-10-03 04:08:17,369 INFO L226 Difference]: Without dead ends: 260 [2019-10-03 04:08:17,370 INFO L640 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-03 04:08:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-03 04:08:17,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2019-10-03 04:08:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-03 04:08:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 368 transitions. [2019-10-03 04:08:17,388 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 368 transitions. Word has length 43 [2019-10-03 04:08:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:17,389 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 368 transitions. [2019-10-03 04:08:17,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 368 transitions. [2019-10-03 04:08:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 04:08:17,392 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:17,393 INFO L411 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-03 04:08:17,393 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:17,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:17,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1578256893, now seen corresponding path program 1 times [2019-10-03 04:08:17,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:17,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:17,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:17,493 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-03 04:08:17,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:17,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:17,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:17,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:17,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:17,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:17,496 INFO L87 Difference]: Start difference. First operand 252 states and 368 transitions. Second operand 3 states. [2019-10-03 04:08:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:17,734 INFO L93 Difference]: Finished difference Result 354 states and 492 transitions. [2019-10-03 04:08:17,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:17,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 04:08:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:17,739 INFO L225 Difference]: With dead ends: 354 [2019-10-03 04:08:17,740 INFO L226 Difference]: Without dead ends: 352 [2019-10-03 04:08:17,740 INFO L640 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-03 04:08:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-10-03 04:08:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2019-10-03 04:08:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-03 04:08:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 468 transitions. [2019-10-03 04:08:17,784 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 468 transitions. Word has length 60 [2019-10-03 04:08:17,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:17,785 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 468 transitions. [2019-10-03 04:08:17,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 468 transitions. [2019-10-03 04:08:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 04:08:17,791 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:17,791 INFO L411 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-03 04:08:17,792 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash -227181441, now seen corresponding path program 1 times [2019-10-03 04:08:17,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:17,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:17,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:17,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:17,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:17,907 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-03 04:08:17,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:17,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:17,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:17,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:17,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:17,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:17,909 INFO L87 Difference]: Start difference. First operand 334 states and 468 transitions. Second operand 3 states. [2019-10-03 04:08:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:18,058 INFO L93 Difference]: Finished difference Result 380 states and 527 transitions. [2019-10-03 04:08:18,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:18,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 04:08:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:18,061 INFO L225 Difference]: With dead ends: 380 [2019-10-03 04:08:18,061 INFO L226 Difference]: Without dead ends: 380 [2019-10-03 04:08:18,062 INFO L640 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-03 04:08:18,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-03 04:08:18,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 372. [2019-10-03 04:08:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-03 04:08:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 516 transitions. [2019-10-03 04:08:18,075 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 516 transitions. Word has length 60 [2019-10-03 04:08:18,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:18,075 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 516 transitions. [2019-10-03 04:08:18,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 516 transitions. [2019-10-03 04:08:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-03 04:08:18,079 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:18,080 INFO L411 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-03 04:08:18,080 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:18,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1103223005, now seen corresponding path program 1 times [2019-10-03 04:08:18,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:18,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:18,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:18,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:18,141 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-03 04:08:18,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:18,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:18,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:18,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:18,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:18,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:18,143 INFO L87 Difference]: Start difference. First operand 372 states and 516 transitions. Second operand 3 states. [2019-10-03 04:08:18,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:18,351 INFO L93 Difference]: Finished difference Result 478 states and 684 transitions. [2019-10-03 04:08:18,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:18,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-03 04:08:18,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:18,355 INFO L225 Difference]: With dead ends: 478 [2019-10-03 04:08:18,356 INFO L226 Difference]: Without dead ends: 476 [2019-10-03 04:08:18,356 INFO L640 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-03 04:08:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-03 04:08:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 450. [2019-10-03 04:08:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-03 04:08:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 650 transitions. [2019-10-03 04:08:18,370 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 650 transitions. Word has length 73 [2019-10-03 04:08:18,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:18,370 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 650 transitions. [2019-10-03 04:08:18,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 650 transitions. [2019-10-03 04:08:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 04:08:18,372 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:18,373 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:08:18,373 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1464237739, now seen corresponding path program 1 times [2019-10-03 04:08:18,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:18,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:18,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:18,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:18,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:18,420 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-03 04:08:18,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:18,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:18,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:18,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:18,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:18,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:18,422 INFO L87 Difference]: Start difference. First operand 450 states and 650 transitions. Second operand 3 states. [2019-10-03 04:08:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:18,549 INFO L93 Difference]: Finished difference Result 498 states and 709 transitions. [2019-10-03 04:08:18,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:18,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-03 04:08:18,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:18,555 INFO L225 Difference]: With dead ends: 498 [2019-10-03 04:08:18,555 INFO L226 Difference]: Without dead ends: 498 [2019-10-03 04:08:18,556 INFO L640 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-03 04:08:18,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-03 04:08:18,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2019-10-03 04:08:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-03 04:08:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 702 transitions. [2019-10-03 04:08:18,569 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 702 transitions. Word has length 76 [2019-10-03 04:08:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:18,570 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 702 transitions. [2019-10-03 04:08:18,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 702 transitions. [2019-10-03 04:08:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 04:08:18,571 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:18,572 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:08:18,572 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:18,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:18,572 INFO L82 PathProgramCache]: Analyzing trace with hash 665980045, now seen corresponding path program 1 times [2019-10-03 04:08:18,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:18,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:18,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:18,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:18,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:18,650 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-03 04:08:18,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:18,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:18,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:18,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:18,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:18,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:18,653 INFO L87 Difference]: Start difference. First operand 492 states and 702 transitions. Second operand 3 states. [2019-10-03 04:08:18,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:18,697 INFO L93 Difference]: Finished difference Result 731 states and 1044 transitions. [2019-10-03 04:08:18,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:18,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-03 04:08:18,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:18,702 INFO L225 Difference]: With dead ends: 731 [2019-10-03 04:08:18,703 INFO L226 Difference]: Without dead ends: 731 [2019-10-03 04:08:18,703 INFO L640 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-03 04:08:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-03 04:08:18,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-10-03 04:08:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-10-03 04:08:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1044 transitions. [2019-10-03 04:08:18,721 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1044 transitions. Word has length 96 [2019-10-03 04:08:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:18,722 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1044 transitions. [2019-10-03 04:08:18,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1044 transitions. [2019-10-03 04:08:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 04:08:18,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:18,729 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:08:18,729 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:18,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:18,730 INFO L82 PathProgramCache]: Analyzing trace with hash -208123337, now seen corresponding path program 1 times [2019-10-03 04:08:18,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:18,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:18,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:18,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:18,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:18,826 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-03 04:08:18,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:18,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:18,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:18,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:18,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:18,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:18,828 INFO L87 Difference]: Start difference. First operand 731 states and 1044 transitions. Second operand 3 states. [2019-10-03 04:08:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:18,866 INFO L93 Difference]: Finished difference Result 970 states and 1388 transitions. [2019-10-03 04:08:18,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:18,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-03 04:08:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:18,871 INFO L225 Difference]: With dead ends: 970 [2019-10-03 04:08:18,872 INFO L226 Difference]: Without dead ends: 970 [2019-10-03 04:08:18,872 INFO L640 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-03 04:08:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-03 04:08:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2019-10-03 04:08:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-10-03 04:08:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1388 transitions. [2019-10-03 04:08:18,895 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1388 transitions. Word has length 98 [2019-10-03 04:08:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:18,895 INFO L475 AbstractCegarLoop]: Abstraction has 970 states and 1388 transitions. [2019-10-03 04:08:18,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1388 transitions. [2019-10-03 04:08:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-03 04:08:18,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:18,898 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:08:18,899 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:18,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:18,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1174534704, now seen corresponding path program 1 times [2019-10-03 04:08:18,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:18,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:18,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:18,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:18,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-03 04:08:18,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:18,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:18,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:18,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:18,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:18,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:18,975 INFO L87 Difference]: Start difference. First operand 970 states and 1388 transitions. Second operand 3 states. [2019-10-03 04:08:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:19,112 INFO L93 Difference]: Finished difference Result 1076 states and 1514 transitions. [2019-10-03 04:08:19,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:19,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-03 04:08:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:19,119 INFO L225 Difference]: With dead ends: 1076 [2019-10-03 04:08:19,119 INFO L226 Difference]: Without dead ends: 1076 [2019-10-03 04:08:19,120 INFO L640 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-03 04:08:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-10-03 04:08:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1062. [2019-10-03 04:08:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-10-03 04:08:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1500 transitions. [2019-10-03 04:08:19,145 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1500 transitions. Word has length 123 [2019-10-03 04:08:19,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:19,146 INFO L475 AbstractCegarLoop]: Abstraction has 1062 states and 1500 transitions. [2019-10-03 04:08:19,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1500 transitions. [2019-10-03 04:08:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-03 04:08:19,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:19,149 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:08:19,150 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:19,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:19,151 INFO L82 PathProgramCache]: Analyzing trace with hash -176623095, now seen corresponding path program 1 times [2019-10-03 04:08:19,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:19,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:19,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:19,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-03 04:08:19,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:19,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:19,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:19,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:19,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:19,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:19,218 INFO L87 Difference]: Start difference. First operand 1062 states and 1500 transitions. Second operand 3 states. [2019-10-03 04:08:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:19,375 INFO L93 Difference]: Finished difference Result 1266 states and 1780 transitions. [2019-10-03 04:08:19,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:19,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-03 04:08:19,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:19,382 INFO L225 Difference]: With dead ends: 1266 [2019-10-03 04:08:19,383 INFO L226 Difference]: Without dead ends: 1258 [2019-10-03 04:08:19,383 INFO L640 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-03 04:08:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-03 04:08:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1218. [2019-10-03 04:08:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-03 04:08:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1724 transitions. [2019-10-03 04:08:19,411 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1724 transitions. Word has length 144 [2019-10-03 04:08:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:19,411 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1724 transitions. [2019-10-03 04:08:19,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1724 transitions. [2019-10-03 04:08:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-03 04:08:19,417 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:19,417 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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-03 04:08:19,418 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:19,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:19,418 INFO L82 PathProgramCache]: Analyzing trace with hash -871418854, now seen corresponding path program 1 times [2019-10-03 04:08:19,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:19,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:19,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:19,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:19,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-03 04:08:19,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:19,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:19,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:19,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:19,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:19,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:19,500 INFO L87 Difference]: Start difference. First operand 1218 states and 1724 transitions. Second operand 3 states. [2019-10-03 04:08:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:19,615 INFO L93 Difference]: Finished difference Result 1338 states and 1864 transitions. [2019-10-03 04:08:19,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:19,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-03 04:08:19,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:19,622 INFO L225 Difference]: With dead ends: 1338 [2019-10-03 04:08:19,622 INFO L226 Difference]: Without dead ends: 1338 [2019-10-03 04:08:19,623 INFO L640 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-03 04:08:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-10-03 04:08:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2019-10-03 04:08:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-10-03 04:08:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1856 transitions. [2019-10-03 04:08:19,653 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1856 transitions. Word has length 180 [2019-10-03 04:08:19,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:19,653 INFO L475 AbstractCegarLoop]: Abstraction has 1330 states and 1856 transitions. [2019-10-03 04:08:19,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1856 transitions. [2019-10-03 04:08:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-03 04:08:19,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:19,657 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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-03 04:08:19,658 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:19,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:19,658 INFO L82 PathProgramCache]: Analyzing trace with hash -310719076, now seen corresponding path program 1 times [2019-10-03 04:08:19,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:19,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:19,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:19,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:19,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-03 04:08:19,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:19,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:19,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:19,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:19,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:19,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:19,720 INFO L87 Difference]: Start difference. First operand 1330 states and 1856 transitions. Second operand 3 states. [2019-10-03 04:08:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:19,891 INFO L93 Difference]: Finished difference Result 1466 states and 2016 transitions. [2019-10-03 04:08:19,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:19,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-03 04:08:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:19,901 INFO L225 Difference]: With dead ends: 1466 [2019-10-03 04:08:19,901 INFO L226 Difference]: Without dead ends: 1466 [2019-10-03 04:08:19,901 INFO L640 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-03 04:08:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-10-03 04:08:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1454. [2019-10-03 04:08:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-10-03 04:08:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2000 transitions. [2019-10-03 04:08:19,941 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2000 transitions. Word has length 180 [2019-10-03 04:08:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:19,942 INFO L475 AbstractCegarLoop]: Abstraction has 1454 states and 2000 transitions. [2019-10-03 04:08:19,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2000 transitions. [2019-10-03 04:08:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-03 04:08:19,953 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:19,954 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 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-03 04:08:19,954 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2035334682, now seen corresponding path program 1 times [2019-10-03 04:08:19,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:19,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:19,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:19,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-10-03 04:08:20,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:20,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:20,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:20,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:20,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:20,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:20,136 INFO L87 Difference]: Start difference. First operand 1454 states and 2000 transitions. Second operand 3 states. [2019-10-03 04:08:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:20,169 INFO L93 Difference]: Finished difference Result 2892 states and 3976 transitions. [2019-10-03 04:08:20,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:20,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-03 04:08:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:20,184 INFO L225 Difference]: With dead ends: 2892 [2019-10-03 04:08:20,184 INFO L226 Difference]: Without dead ends: 2892 [2019-10-03 04:08:20,184 INFO L640 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-03 04:08:20,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2019-10-03 04:08:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2890. [2019-10-03 04:08:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2019-10-03 04:08:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3975 transitions. [2019-10-03 04:08:20,250 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3975 transitions. Word has length 210 [2019-10-03 04:08:20,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:20,251 INFO L475 AbstractCegarLoop]: Abstraction has 2890 states and 3975 transitions. [2019-10-03 04:08:20,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:20,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3975 transitions. [2019-10-03 04:08:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-03 04:08:20,258 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:20,258 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 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-03 04:08:20,258 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:20,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:20,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932836, now seen corresponding path program 1 times [2019-10-03 04:08:20,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:20,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:20,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:20,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:20,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-03 04:08:20,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:20,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:20,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:20,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:20,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:20,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:20,362 INFO L87 Difference]: Start difference. First operand 2890 states and 3975 transitions. Second operand 3 states. [2019-10-03 04:08:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:20,514 INFO L93 Difference]: Finished difference Result 3190 states and 4315 transitions. [2019-10-03 04:08:20,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:20,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-03 04:08:20,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:20,530 INFO L225 Difference]: With dead ends: 3190 [2019-10-03 04:08:20,530 INFO L226 Difference]: Without dead ends: 3190 [2019-10-03 04:08:20,530 INFO L640 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-03 04:08:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2019-10-03 04:08:20,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3174. [2019-10-03 04:08:20,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2019-10-03 04:08:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4299 transitions. [2019-10-03 04:08:20,598 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4299 transitions. Word has length 210 [2019-10-03 04:08:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:20,599 INFO L475 AbstractCegarLoop]: Abstraction has 3174 states and 4299 transitions. [2019-10-03 04:08:20,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4299 transitions. [2019-10-03 04:08:20,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 04:08:20,606 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:20,607 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:08:20,607 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:20,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:20,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1588238652, now seen corresponding path program 1 times [2019-10-03 04:08:20,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:20,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:20,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:20,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:20,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-10-03 04:08:20,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:20,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:20,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:20,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:20,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:20,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:20,743 INFO L87 Difference]: Start difference. First operand 3174 states and 4299 transitions. Second operand 3 states. [2019-10-03 04:08:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:20,899 INFO L93 Difference]: Finished difference Result 3322 states and 4467 transitions. [2019-10-03 04:08:20,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:20,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-03 04:08:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:20,914 INFO L225 Difference]: With dead ends: 3322 [2019-10-03 04:08:20,914 INFO L226 Difference]: Without dead ends: 3322 [2019-10-03 04:08:20,914 INFO L640 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-03 04:08:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2019-10-03 04:08:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3306. [2019-10-03 04:08:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2019-10-03 04:08:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4451 transitions. [2019-10-03 04:08:20,984 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4451 transitions. Word has length 234 [2019-10-03 04:08:20,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:20,985 INFO L475 AbstractCegarLoop]: Abstraction has 3306 states and 4451 transitions. [2019-10-03 04:08:20,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4451 transitions. [2019-10-03 04:08:20,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-03 04:08:20,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:20,994 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:08:20,994 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:20,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash -736614694, now seen corresponding path program 1 times [2019-10-03 04:08:20,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:20,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:20,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:20,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:20,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-10-03 04:08:21,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:21,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:21,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:21,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:21,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:21,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:21,079 INFO L87 Difference]: Start difference. First operand 3306 states and 4451 transitions. Second operand 3 states. [2019-10-03 04:08:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:21,309 INFO L93 Difference]: Finished difference Result 3706 states and 4923 transitions. [2019-10-03 04:08:21,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:21,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-10-03 04:08:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:21,330 INFO L225 Difference]: With dead ends: 3706 [2019-10-03 04:08:21,330 INFO L226 Difference]: Without dead ends: 3706 [2019-10-03 04:08:21,331 INFO L640 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-03 04:08:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2019-10-03 04:08:21,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3618. [2019-10-03 04:08:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2019-10-03 04:08:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4819 transitions. [2019-10-03 04:08:21,438 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4819 transitions. Word has length 245 [2019-10-03 04:08:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:21,439 INFO L475 AbstractCegarLoop]: Abstraction has 3618 states and 4819 transitions. [2019-10-03 04:08:21,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4819 transitions. [2019-10-03 04:08:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-03 04:08:21,454 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:21,455 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:08:21,455 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:21,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:21,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1168177660, now seen corresponding path program 1 times [2019-10-03 04:08:21,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:21,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:21,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:21,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:21,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-10-03 04:08:21,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:21,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:21,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:21,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:21,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:21,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:21,618 INFO L87 Difference]: Start difference. First operand 3618 states and 4819 transitions. Second operand 3 states. [2019-10-03 04:08:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:21,794 INFO L93 Difference]: Finished difference Result 4026 states and 5267 transitions. [2019-10-03 04:08:21,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:21,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-10-03 04:08:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:21,833 INFO L225 Difference]: With dead ends: 4026 [2019-10-03 04:08:21,833 INFO L226 Difference]: Without dead ends: 4026 [2019-10-03 04:08:21,834 INFO L640 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-03 04:08:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2019-10-03 04:08:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3738. [2019-10-03 04:08:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2019-10-03 04:08:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 4963 transitions. [2019-10-03 04:08:21,901 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 4963 transitions. Word has length 259 [2019-10-03 04:08:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:21,902 INFO L475 AbstractCegarLoop]: Abstraction has 3738 states and 4963 transitions. [2019-10-03 04:08:21,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4963 transitions. [2019-10-03 04:08:21,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-03 04:08:21,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:21,914 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:08:21,914 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:21,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:21,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1227839833, now seen corresponding path program 1 times [2019-10-03 04:08:21,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:21,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:21,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:21,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:21,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-10-03 04:08:22,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:22,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:22,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:22,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:22,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:22,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:22,076 INFO L87 Difference]: Start difference. First operand 3738 states and 4963 transitions. Second operand 3 states. [2019-10-03 04:08:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:22,108 INFO L93 Difference]: Finished difference Result 6960 states and 9294 transitions. [2019-10-03 04:08:22,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:22,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-10-03 04:08:22,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:22,124 INFO L225 Difference]: With dead ends: 6960 [2019-10-03 04:08:22,124 INFO L226 Difference]: Without dead ends: 6960 [2019-10-03 04:08:22,125 INFO L640 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-03 04:08:22,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6960 states. [2019-10-03 04:08:22,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6960 to 6958. [2019-10-03 04:08:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6958 states. [2019-10-03 04:08:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 9293 transitions. [2019-10-03 04:08:22,238 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 9293 transitions. Word has length 260 [2019-10-03 04:08:22,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:22,239 INFO L475 AbstractCegarLoop]: Abstraction has 6958 states and 9293 transitions. [2019-10-03 04:08:22,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 9293 transitions. [2019-10-03 04:08:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-03 04:08:22,256 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:22,256 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:08:22,257 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:22,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:22,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818967, now seen corresponding path program 1 times [2019-10-03 04:08:22,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:22,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:22,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:22,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:22,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2019-10-03 04:08:22,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:22,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:22,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:22,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:22,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:22,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:22,379 INFO L87 Difference]: Start difference. First operand 6958 states and 9293 transitions. Second operand 3 states. [2019-10-03 04:08:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:22,568 INFO L93 Difference]: Finished difference Result 6966 states and 9109 transitions. [2019-10-03 04:08:22,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:22,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-03 04:08:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:22,583 INFO L225 Difference]: With dead ends: 6966 [2019-10-03 04:08:22,583 INFO L226 Difference]: Without dead ends: 6966 [2019-10-03 04:08:22,583 INFO L640 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-03 04:08:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2019-10-03 04:08:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 6934. [2019-10-03 04:08:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6934 states. [2019-10-03 04:08:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 9077 transitions. [2019-10-03 04:08:22,681 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 9077 transitions. Word has length 261 [2019-10-03 04:08:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:22,681 INFO L475 AbstractCegarLoop]: Abstraction has 6934 states and 9077 transitions. [2019-10-03 04:08:22,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 9077 transitions. [2019-10-03 04:08:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-03 04:08:22,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:22,695 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:08:22,695 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:22,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:22,695 INFO L82 PathProgramCache]: Analyzing trace with hash 747649846, now seen corresponding path program 1 times [2019-10-03 04:08:22,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:22,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:22,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:22,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:22,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 318 proven. 18 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-10-03 04:08:22,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:22,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:08:22,861 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2019-10-03 04:08:22,863 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [245], [248], [256], [259], [264], [267], [275], [280], [282], [288], [291], [299], [301], [303], [306], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2019-10-03 04:08:22,917 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:08:22,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:08:23,094 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:08:23,099 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 81 root evaluator evaluations with a maximum evaluation depth of 5. Performed 81 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 102 variables. [2019-10-03 04:08:23,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:23,104 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:08:23,378 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 76.51% of their original sizes. [2019-10-03 04:08:23,379 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:08:23,575 INFO L420 sIntCurrentIteration]: We unified 283 AI predicates to 283 [2019-10-03 04:08:23,575 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:08:23,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:08:23,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2019-10-03 04:08:23,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:23,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 04:08:23,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 04:08:23,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-03 04:08:23,578 INFO L87 Difference]: Start difference. First operand 6934 states and 9077 transitions. Second operand 13 states. [2019-10-03 04:08:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:24,488 INFO L93 Difference]: Finished difference Result 6938 states and 9081 transitions. [2019-10-03 04:08:24,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:08:24,488 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 284 [2019-10-03 04:08:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:24,502 INFO L225 Difference]: With dead ends: 6938 [2019-10-03 04:08:24,502 INFO L226 Difference]: Without dead ends: 6938 [2019-10-03 04:08:24,502 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-10-03 04:08:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6938 states. [2019-10-03 04:08:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6938 to 6937. [2019-10-03 04:08:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6937 states. [2019-10-03 04:08:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6937 states to 6937 states and 9080 transitions. [2019-10-03 04:08:24,618 INFO L78 Accepts]: Start accepts. Automaton has 6937 states and 9080 transitions. Word has length 284 [2019-10-03 04:08:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:24,618 INFO L475 AbstractCegarLoop]: Abstraction has 6937 states and 9080 transitions. [2019-10-03 04:08:24,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 04:08:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 6937 states and 9080 transitions. [2019-10-03 04:08:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-03 04:08:24,633 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:24,633 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:08:24,634 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:24,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash -39333344, now seen corresponding path program 1 times [2019-10-03 04:08:24,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:24,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:24,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:24,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:24,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-03 04:08:24,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:24,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:08:24,815 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 298 with the following transitions: [2019-10-03 04:08:24,815 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [275], [280], [282], [288], [291], [299], [301], [303], [306], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2019-10-03 04:08:24,825 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:08:24,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:08:26,488 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:08:26,490 INFO L272 AbstractInterpreter]: Visited 107 different actions 1841 times. Merged at 95 different actions 1506 times. Widened at 20 different actions 203 times. Performed 4800 root evaluator evaluations with a maximum evaluation depth of 5. Performed 4800 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 220 fixpoints after 27 different actions. Largest state had 104 variables. [2019-10-03 04:08:26,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:26,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:08:26,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:26,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:08:26,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:26,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:08:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:26,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:08:26,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:08:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-03 04:08:26,760 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:08:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-03 04:08:26,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:08:26,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:08:26,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:08:26,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:08:26,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:08:26,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:08:26,857 INFO L87 Difference]: Start difference. First operand 6937 states and 9080 transitions. Second operand 4 states. [2019-10-03 04:08:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:27,216 INFO L93 Difference]: Finished difference Result 10415 states and 13403 transitions. [2019-10-03 04:08:27,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:08:27,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-10-03 04:08:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:27,236 INFO L225 Difference]: With dead ends: 10415 [2019-10-03 04:08:27,236 INFO L226 Difference]: Without dead ends: 10407 [2019-10-03 04:08:27,236 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 594 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-03 04:08:27,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10407 states. [2019-10-03 04:08:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10407 to 8841. [2019-10-03 04:08:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2019-10-03 04:08:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 11578 transitions. [2019-10-03 04:08:27,466 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 11578 transitions. Word has length 297 [2019-10-03 04:08:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:27,467 INFO L475 AbstractCegarLoop]: Abstraction has 8841 states and 11578 transitions. [2019-10-03 04:08:27,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:08:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 11578 transitions. [2019-10-03 04:08:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-03 04:08:27,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:27,485 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:08:27,486 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:27,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:27,486 INFO L82 PathProgramCache]: Analyzing trace with hash 280748442, now seen corresponding path program 2 times [2019-10-03 04:08:27,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:27,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:27,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:27,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:27,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 407 proven. 5 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-03 04:08:27,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:27,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:08:27,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 04:08:27,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 04:08:27,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:27,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-03 04:08:27,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 04:08:27,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:08:27,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-03 04:08:27,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 04:08:27,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:08:27,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:08:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2019-10-03 04:08:27,878 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:08:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2019-10-03 04:08:27,985 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:08:27,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-03 04:08:27,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:27,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:27,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:27,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:08:27,989 INFO L87 Difference]: Start difference. First operand 8841 states and 11578 transitions. Second operand 3 states. [2019-10-03 04:08:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:28,168 INFO L93 Difference]: Finished difference Result 9273 states and 12154 transitions. [2019-10-03 04:08:28,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:28,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-10-03 04:08:28,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:28,186 INFO L225 Difference]: With dead ends: 9273 [2019-10-03 04:08:28,187 INFO L226 Difference]: Without dead ends: 9273 [2019-10-03 04:08:28,190 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:08:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2019-10-03 04:08:28,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 9201. [2019-10-03 04:08:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9201 states. [2019-10-03 04:08:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9201 states to 9201 states and 12058 transitions. [2019-10-03 04:08:28,382 INFO L78 Accepts]: Start accepts. Automaton has 9201 states and 12058 transitions. Word has length 310 [2019-10-03 04:08:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:28,383 INFO L475 AbstractCegarLoop]: Abstraction has 9201 states and 12058 transitions. [2019-10-03 04:08:28,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 9201 states and 12058 transitions. [2019-10-03 04:08:28,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-03 04:08:28,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:28,461 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:08:28,461 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash 670685447, now seen corresponding path program 1 times [2019-10-03 04:08:28,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:28,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:28,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 04:08:28,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:28,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-03 04:08:28,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:28,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:08:28,625 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 378 with the following transitions: [2019-10-03 04:08:28,625 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [250], [256], [259], [264], [267], [269], [275], [280], [282], [286], [288], [291], [299], [301], [303], [306], [308], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2019-10-03 04:08:28,629 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:08:28,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:08:30,142 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:08:30,142 INFO L272 AbstractInterpreter]: Visited 111 different actions 2385 times. Merged at 100 different actions 1906 times. Widened at 21 different actions 238 times. Performed 6226 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 352 fixpoints after 46 different actions. Largest state had 104 variables. [2019-10-03 04:08:30,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:30,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:08:30,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:30,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:08:30,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:30,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:08:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:30,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:08:30,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:08:30,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-10-03 04:08:30,390 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:08:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-10-03 04:08:30,497 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:08:30,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-03 04:08:30,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:30,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:30,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:30,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:08:30,499 INFO L87 Difference]: Start difference. First operand 9201 states and 12058 transitions. Second operand 3 states. [2019-10-03 04:08:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:30,548 INFO L93 Difference]: Finished difference Result 13769 states and 18004 transitions. [2019-10-03 04:08:30,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:30,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 377 [2019-10-03 04:08:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:30,576 INFO L225 Difference]: With dead ends: 13769 [2019-10-03 04:08:30,576 INFO L226 Difference]: Without dead ends: 13769 [2019-10-03 04:08:30,576 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 754 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-03 04:08:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13769 states. [2019-10-03 04:08:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 13769. [2019-10-03 04:08:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13769 states. [2019-10-03 04:08:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13769 states to 13769 states and 18004 transitions. [2019-10-03 04:08:30,810 INFO L78 Accepts]: Start accepts. Automaton has 13769 states and 18004 transitions. Word has length 377 [2019-10-03 04:08:30,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:30,811 INFO L475 AbstractCegarLoop]: Abstraction has 13769 states and 18004 transitions. [2019-10-03 04:08:30,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 13769 states and 18004 transitions. [2019-10-03 04:08:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-03 04:08:30,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:30,835 INFO L411 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:08:30,835 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:30,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:30,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2068327023, now seen corresponding path program 1 times [2019-10-03 04:08:30,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:30,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:30,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:30,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:30,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-03 04:08:30,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:30,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:08:30,995 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 380 with the following transitions: [2019-10-03 04:08:30,995 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [250], [256], [259], [264], [267], [269], [275], [280], [282], [288], [291], [293], [299], [301], [303], [306], [308], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2019-10-03 04:08:31,009 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:08:31,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:08:32,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:08:32,423 INFO L272 AbstractInterpreter]: Visited 111 different actions 2298 times. Merged at 99 different actions 1838 times. Widened at 20 different actions 222 times. Performed 5880 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5880 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 331 fixpoints after 42 different actions. Largest state had 104 variables. [2019-10-03 04:08:32,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:32,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:08:32,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:32,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:08:32,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:32,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:08:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:32,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:08:32,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:08:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-03 04:08:32,732 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:08:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 04:08:32,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:08:32,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:08:32,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:08:32,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:08:32,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:08:32,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:08:32,856 INFO L87 Difference]: Start difference. First operand 13769 states and 18004 transitions. Second operand 4 states. [2019-10-03 04:08:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:33,256 INFO L93 Difference]: Finished difference Result 17184 states and 22132 transitions. [2019-10-03 04:08:33,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:08:33,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-10-03 04:08:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:33,286 INFO L225 Difference]: With dead ends: 17184 [2019-10-03 04:08:33,286 INFO L226 Difference]: Without dead ends: 17172 [2019-10-03 04:08:33,286 INFO L640 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-03 04:08:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17172 states. [2019-10-03 04:08:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17172 to 14517. [2019-10-03 04:08:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14517 states. [2019-10-03 04:08:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14517 states to 14517 states and 18566 transitions. [2019-10-03 04:08:33,505 INFO L78 Accepts]: Start accepts. Automaton has 14517 states and 18566 transitions. Word has length 379 [2019-10-03 04:08:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:33,506 INFO L475 AbstractCegarLoop]: Abstraction has 14517 states and 18566 transitions. [2019-10-03 04:08:33,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:08:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 14517 states and 18566 transitions. [2019-10-03 04:08:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-10-03 04:08:33,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:33,538 INFO L411 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, 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-03 04:08:33,538 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:33,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:33,538 INFO L82 PathProgramCache]: Analyzing trace with hash -725462501, now seen corresponding path program 1 times [2019-10-03 04:08:33,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:33,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:33,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:33,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:33,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-03 04:08:33,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:33,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:33,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:33,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:33,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:33,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:33,807 INFO L87 Difference]: Start difference. First operand 14517 states and 18566 transitions. Second operand 3 states. [2019-10-03 04:08:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:33,972 INFO L93 Difference]: Finished difference Result 13251 states and 16445 transitions. [2019-10-03 04:08:33,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:33,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-10-03 04:08:33,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:33,983 INFO L225 Difference]: With dead ends: 13251 [2019-10-03 04:08:33,983 INFO L226 Difference]: Without dead ends: 5532 [2019-10-03 04:08:33,983 INFO L640 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-03 04:08:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2019-10-03 04:08:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5191. [2019-10-03 04:08:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5191 states. [2019-10-03 04:08:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 6440 transitions. [2019-10-03 04:08:34,041 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 6440 transitions. Word has length 418 [2019-10-03 04:08:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:34,042 INFO L475 AbstractCegarLoop]: Abstraction has 5191 states and 6440 transitions. [2019-10-03 04:08:34,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 6440 transitions. [2019-10-03 04:08:34,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-03 04:08:34,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:34,049 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:08:34,049 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:34,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:34,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1911375163, now seen corresponding path program 1 times [2019-10-03 04:08:34,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:34,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:34,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:34,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-03 04:08:34,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:34,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:08:34,220 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 448 with the following transitions: [2019-10-03 04:08:34,220 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [183], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [275], [278], [282], [288], [291], [299], [301], [303], [306], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [412], [417], [422], [424], [429], [432], [436], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2019-10-03 04:08:34,225 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:08:34,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:08:34,672 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:08:34,673 INFO L272 AbstractInterpreter]: Visited 113 different actions 628 times. Merged at 98 different actions 449 times. Widened at 15 different actions 19 times. Performed 1635 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1635 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 61 fixpoints after 22 different actions. Largest state had 105 variables. [2019-10-03 04:08:34,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:34,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:08:34,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:34,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:08:34,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:34,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:08:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:34,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:08:34,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:08:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-03 04:08:35,016 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:08:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-03 04:08:35,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:08:35,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:08:35,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:08:35,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:08:35,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:08:35,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:08:35,152 INFO L87 Difference]: Start difference. First operand 5191 states and 6440 transitions. Second operand 4 states. [2019-10-03 04:08:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:35,325 INFO L93 Difference]: Finished difference Result 512 states and 589 transitions. [2019-10-03 04:08:35,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:08:35,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2019-10-03 04:08:35,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:35,326 INFO L225 Difference]: With dead ends: 512 [2019-10-03 04:08:35,326 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 04:08:35,326 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 899 GetRequests, 894 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-03 04:08:35,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 04:08:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 04:08:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 04:08:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 04:08:35,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 447 [2019-10-03 04:08:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:35,327 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 04:08:35,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:08:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 04:08:35,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 04:08:35,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:08:35 BoogieIcfgContainer [2019-10-03 04:08:35,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 04:08:35,340 INFO L168 Benchmark]: Toolchain (without parser) took 20294.31 ms. Allocated memory was 134.2 MB in the beginning and 1.1 GB in the end (delta: 988.8 MB). Free memory was 89.3 MB in the beginning and 660.8 MB in the end (delta: -571.5 MB). Peak memory consumption was 417.3 MB. Max. memory is 7.1 GB. [2019-10-03 04:08:35,341 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 04:08:35,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 519.41 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 89.1 MB in the beginning and 174.1 MB in the end (delta: -85.0 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2019-10-03 04:08:35,343 INFO L168 Benchmark]: Boogie Preprocessor took 70.47 ms. Allocated memory is still 200.8 MB. Free memory was 174.1 MB in the beginning and 171.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-03 04:08:35,343 INFO L168 Benchmark]: RCFGBuilder took 815.05 ms. Allocated memory is still 200.8 MB. Free memory was 171.6 MB in the beginning and 125.2 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-10-03 04:08:35,344 INFO L168 Benchmark]: TraceAbstraction took 18884.68 ms. Allocated memory was 200.8 MB in the beginning and 1.1 GB in the end (delta: 922.2 MB). Free memory was 124.6 MB in the beginning and 660.8 MB in the end (delta: -536.2 MB). Peak memory consumption was 386.0 MB. Max. memory is 7.1 GB. [2019-10-03 04:08:35,349 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 519.41 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 89.1 MB in the beginning and 174.1 MB in the end (delta: -85.0 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.47 ms. Allocated memory is still 200.8 MB. Free memory was 174.1 MB in the beginning and 171.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 815.05 ms. Allocated memory is still 200.8 MB. Free memory was 171.6 MB in the beginning and 125.2 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18884.68 ms. Allocated memory was 200.8 MB in the beginning and 1.1 GB in the end (delta: 922.2 MB). Free memory was 124.6 MB in the beginning and 660.8 MB in the end (delta: -536.2 MB). Peak memory consumption was 386.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 135 locations, 1 error locations. SAFE Result, 18.8s OverallTime, 26 OverallIterations, 18 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5329 SDtfs, 1846 SDslu, 3099 SDs, 0 SdLazy, 2580 SolverSat, 436 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3986 GetRequests, 3932 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14517occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.3s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.7726100658962848 AbsIntWeakeningRatio, 0.4452296819787986 AbsIntAvgWeakeningVarsNumRemoved, -1.6819787985865724 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 5219 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 7163 NumberOfCodeBlocks, 6895 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8937 ConstructedInterpolants, 0 QuantifiedInterpolants, 3878485 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3059 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 36 InterpolantComputations, 24 PerfectInterpolantSequences, 30533/30672 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...