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/bitvector/s3_clnt_3.BV.c.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:44:20,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:44:20,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:44:20,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:44:20,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:44:20,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:44:20,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:44:20,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:44:20,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:44:20,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:44:20,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:44:20,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:44:20,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:44:20,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:44:20,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:44:20,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:44:20,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:44:20,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:44:20,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:44:20,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:44:20,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:44:20,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:44:20,169 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:44:20,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:44:20,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:44:20,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:44:20,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:44:20,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:44:20,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:44:20,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:44:20,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:44:20,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:44:20,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:44:20,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:44:20,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:44:20,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:44:20,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:44:20,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:44:20,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:44:20,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:44:20,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:44:20,183 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-09-09 05:44:20,198 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:44:20,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:44:20,199 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:44:20,199 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:44:20,200 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:44:20,200 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:44:20,200 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:44:20,200 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:44:20,201 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:44:20,201 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:44:20,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:44:20,202 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:44:20,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:44:20,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:44:20,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:44:20,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:44:20,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:44:20,203 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:44:20,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:44:20,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:44:20,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:44:20,205 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:44:20,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:44:20,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:44:20,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:44:20,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:44:20,206 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:44:20,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:44:20,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:44:20,207 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:44:20,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:44:20,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:44:20,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:44:20,266 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:44:20,266 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:44:20,267 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-1.c [2019-09-09 05:44:20,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8992efc03/ac5bdfb319c540bc81471e0c4352274b/FLAG7a8132bb5 [2019-09-09 05:44:20,806 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:44:20,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-1.c [2019-09-09 05:44:20,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8992efc03/ac5bdfb319c540bc81471e0c4352274b/FLAG7a8132bb5 [2019-09-09 05:44:21,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8992efc03/ac5bdfb319c540bc81471e0c4352274b [2019-09-09 05:44:21,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:44:21,190 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:44:21,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:21,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:44:21,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:44:21,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:21" (1/1) ... [2019-09-09 05:44:21,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262768b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:21, skipping insertion in model container [2019-09-09 05:44:21,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:21" (1/1) ... [2019-09-09 05:44:21,210 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:44:21,283 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:44:21,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:21,763 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:44:21,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:21,836 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:44:21,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:21 WrapperNode [2019-09-09 05:44:21,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:21,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:44:21,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:44:21,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:44:21,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:21" (1/1) ... [2019-09-09 05:44:21,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:21" (1/1) ... [2019-09-09 05:44:21,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:21" (1/1) ... [2019-09-09 05:44:21,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:21" (1/1) ... [2019-09-09 05:44:21,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:21" (1/1) ... [2019-09-09 05:44:21,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:21" (1/1) ... [2019-09-09 05:44:21,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:21" (1/1) ... [2019-09-09 05:44:21,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:44:21,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:44:21,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:44:21,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:44:21,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:21" (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-09-09 05:44:21,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:44:21,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:44:21,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-09 05:44:21,965 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:44:21,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:44:21,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:44:21,965 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-09 05:44:21,966 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:44:21,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:44:21,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:44:22,116 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:44:22,612 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-09 05:44:22,613 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-09 05:44:22,622 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:44:22,623 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:44:22,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:22 BoogieIcfgContainer [2019-09-09 05:44:22,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:44:22,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:44:22,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:44:22,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:44:22,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:44:21" (1/3) ... [2019-09-09 05:44:22,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2987e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:22, skipping insertion in model container [2019-09-09 05:44:22,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:21" (2/3) ... [2019-09-09 05:44:22,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2987e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:22, skipping insertion in model container [2019-09-09 05:44:22,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:22" (3/3) ... [2019-09-09 05:44:22,635 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1.c [2019-09-09 05:44:22,646 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:44:22,656 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:44:22,675 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:44:22,708 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:44:22,708 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:44:22,709 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:44:22,709 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:44:22,709 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:44:22,709 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:44:22,709 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:44:22,710 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:44:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2019-09-09 05:44:22,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:44:22,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:22,758 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:22,761 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:22,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1233902378, now seen corresponding path program 1 times [2019-09-09 05:44:22,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:22,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:22,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:22,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:22,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:23,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:23,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:23,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:23,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:23,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:23,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:23,040 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 3 states. [2019-09-09 05:44:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:23,261 INFO L93 Difference]: Finished difference Result 137 states and 223 transitions. [2019-09-09 05:44:23,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:23,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:44:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:23,276 INFO L225 Difference]: With dead ends: 137 [2019-09-09 05:44:23,276 INFO L226 Difference]: Without dead ends: 118 [2019-09-09 05:44:23,278 INFO L628 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-09-09 05:44:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-09 05:44:23,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-09 05:44:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-09 05:44:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 176 transitions. [2019-09-09 05:44:23,333 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 176 transitions. Word has length 30 [2019-09-09 05:44:23,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:23,333 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 176 transitions. [2019-09-09 05:44:23,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 176 transitions. [2019-09-09 05:44:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-09 05:44:23,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:23,336 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:23,337 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:23,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:23,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1082493398, now seen corresponding path program 1 times [2019-09-09 05:44:23,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:23,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:23,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:23,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:23,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:23,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:23,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:23,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:23,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:23,427 INFO L87 Difference]: Start difference. First operand 118 states and 176 transitions. Second operand 3 states. [2019-09-09 05:44:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:23,627 INFO L93 Difference]: Finished difference Result 136 states and 200 transitions. [2019-09-09 05:44:23,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:23,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-09-09 05:44:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:23,630 INFO L225 Difference]: With dead ends: 136 [2019-09-09 05:44:23,630 INFO L226 Difference]: Without dead ends: 136 [2019-09-09 05:44:23,631 INFO L628 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-09-09 05:44:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-09 05:44:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2019-09-09 05:44:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-09 05:44:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2019-09-09 05:44:23,643 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 42 [2019-09-09 05:44:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:23,643 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2019-09-09 05:44:23,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2019-09-09 05:44:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-09 05:44:23,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:23,646 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-09 05:44:23,647 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:23,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:23,647 INFO L82 PathProgramCache]: Analyzing trace with hash -636452013, now seen corresponding path program 1 times [2019-09-09 05:44:23,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:23,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:23,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:23,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:23,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-09 05:44:23,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:23,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:23,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:23,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:23,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:23,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:23,774 INFO L87 Difference]: Start difference. First operand 133 states and 196 transitions. Second operand 3 states. [2019-09-09 05:44:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:23,934 INFO L93 Difference]: Finished difference Result 154 states and 224 transitions. [2019-09-09 05:44:23,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:23,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-09 05:44:23,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:23,938 INFO L225 Difference]: With dead ends: 154 [2019-09-09 05:44:23,938 INFO L226 Difference]: Without dead ends: 154 [2019-09-09 05:44:23,939 INFO L628 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-09-09 05:44:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-09 05:44:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2019-09-09 05:44:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-09 05:44:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 218 transitions. [2019-09-09 05:44:23,953 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 218 transitions. Word has length 56 [2019-09-09 05:44:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:23,953 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 218 transitions. [2019-09-09 05:44:23,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 218 transitions. [2019-09-09 05:44:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-09 05:44:23,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:23,956 INFO L399 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-09-09 05:44:23,957 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:23,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:23,957 INFO L82 PathProgramCache]: Analyzing trace with hash 327884321, now seen corresponding path program 1 times [2019-09-09 05:44:23,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:23,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:23,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:23,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:23,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-09 05:44:24,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:24,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:24,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:24,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:24,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:24,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:24,085 INFO L87 Difference]: Start difference. First operand 150 states and 218 transitions. Second operand 3 states. [2019-09-09 05:44:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:24,124 INFO L93 Difference]: Finished difference Result 282 states and 411 transitions. [2019-09-09 05:44:24,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:24,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-09 05:44:24,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:24,130 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:44:24,131 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:44:24,131 INFO L628 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-09-09 05:44:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:44:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-09-09 05:44:24,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-09 05:44:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 411 transitions. [2019-09-09 05:44:24,166 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 411 transitions. Word has length 73 [2019-09-09 05:44:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:24,167 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 411 transitions. [2019-09-09 05:44:24,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 411 transitions. [2019-09-09 05:44:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-09 05:44:24,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:24,173 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:24,173 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:24,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:24,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1769484127, now seen corresponding path program 1 times [2019-09-09 05:44:24,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:24,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:24,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:24,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:24,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-09 05:44:24,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:24,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:24,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:24,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:24,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:24,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:24,267 INFO L87 Difference]: Start difference. First operand 282 states and 411 transitions. Second operand 3 states. [2019-09-09 05:44:24,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:24,419 INFO L93 Difference]: Finished difference Result 330 states and 470 transitions. [2019-09-09 05:44:24,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:24,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-09 05:44:24,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:24,423 INFO L225 Difference]: With dead ends: 330 [2019-09-09 05:44:24,423 INFO L226 Difference]: Without dead ends: 330 [2019-09-09 05:44:24,423 INFO L628 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-09-09 05:44:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-09 05:44:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 324. [2019-09-09 05:44:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-09-09 05:44:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 463 transitions. [2019-09-09 05:44:24,438 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 463 transitions. Word has length 91 [2019-09-09 05:44:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:24,439 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 463 transitions. [2019-09-09 05:44:24,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 463 transitions. [2019-09-09 05:44:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 05:44:24,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:24,442 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 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, 1, 1, 1] [2019-09-09 05:44:24,443 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:24,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:24,443 INFO L82 PathProgramCache]: Analyzing trace with hash 91325785, now seen corresponding path program 1 times [2019-09-09 05:44:24,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:24,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:24,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:24,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:24,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-09 05:44:24,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:24,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:24,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:24,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:24,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:24,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:24,591 INFO L87 Difference]: Start difference. First operand 324 states and 463 transitions. Second operand 3 states. [2019-09-09 05:44:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:24,631 INFO L93 Difference]: Finished difference Result 477 states and 684 transitions. [2019-09-09 05:44:24,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:24,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-09 05:44:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:24,637 INFO L225 Difference]: With dead ends: 477 [2019-09-09 05:44:24,637 INFO L226 Difference]: Without dead ends: 477 [2019-09-09 05:44:24,638 INFO L628 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-09-09 05:44:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-09 05:44:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2019-09-09 05:44:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-09-09 05:44:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 684 transitions. [2019-09-09 05:44:24,656 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 684 transitions. Word has length 111 [2019-09-09 05:44:24,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:24,658 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 684 transitions. [2019-09-09 05:44:24,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 684 transitions. [2019-09-09 05:44:24,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-09 05:44:24,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:24,662 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 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] [2019-09-09 05:44:24,662 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:24,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:24,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1758997330, now seen corresponding path program 1 times [2019-09-09 05:44:24,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:24,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:24,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:24,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:24,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-09 05:44:24,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:24,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:24,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:24,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:24,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:24,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:24,759 INFO L87 Difference]: Start difference. First operand 477 states and 684 transitions. Second operand 3 states. [2019-09-09 05:44:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:24,963 INFO L93 Difference]: Finished difference Result 627 states and 915 transitions. [2019-09-09 05:44:24,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:24,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-09 05:44:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:24,968 INFO L225 Difference]: With dead ends: 627 [2019-09-09 05:44:24,969 INFO L226 Difference]: Without dead ends: 624 [2019-09-09 05:44:24,969 INFO L628 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-09-09 05:44:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-09-09 05:44:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 600. [2019-09-09 05:44:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-09 05:44:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 882 transitions. [2019-09-09 05:44:24,986 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 882 transitions. Word has length 129 [2019-09-09 05:44:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:24,986 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 882 transitions. [2019-09-09 05:44:24,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 882 transitions. [2019-09-09 05:44:24,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:44:24,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:24,990 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:44:24,990 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:24,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:24,991 INFO L82 PathProgramCache]: Analyzing trace with hash 953297081, now seen corresponding path program 1 times [2019-09-09 05:44:24,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:24,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:24,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:24,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:24,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-09 05:44:25,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:25,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:25,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:25,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:25,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:25,058 INFO L87 Difference]: Start difference. First operand 600 states and 882 transitions. Second operand 3 states. [2019-09-09 05:44:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:25,248 INFO L93 Difference]: Finished difference Result 878 states and 1229 transitions. [2019-09-09 05:44:25,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:25,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-09 05:44:25,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:25,254 INFO L225 Difference]: With dead ends: 878 [2019-09-09 05:44:25,254 INFO L226 Difference]: Without dead ends: 827 [2019-09-09 05:44:25,255 INFO L628 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-09-09 05:44:25,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2019-09-09 05:44:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 789. [2019-09-09 05:44:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-09 05:44:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1134 transitions. [2019-09-09 05:44:25,277 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1134 transitions. Word has length 155 [2019-09-09 05:44:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:25,278 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1134 transitions. [2019-09-09 05:44:25,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1134 transitions. [2019-09-09 05:44:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-09 05:44:25,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:25,281 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-09-09 05:44:25,281 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:25,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash -260724200, now seen corresponding path program 1 times [2019-09-09 05:44:25,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:25,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:25,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:25,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:25,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-09-09 05:44:25,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:25,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:25,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:25,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:25,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:25,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:25,364 INFO L87 Difference]: Start difference. First operand 789 states and 1134 transitions. Second operand 3 states. [2019-09-09 05:44:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:25,521 INFO L93 Difference]: Finished difference Result 945 states and 1320 transitions. [2019-09-09 05:44:25,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:25,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-09 05:44:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:25,527 INFO L225 Difference]: With dead ends: 945 [2019-09-09 05:44:25,527 INFO L226 Difference]: Without dead ends: 900 [2019-09-09 05:44:25,528 INFO L628 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-09-09 05:44:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-09-09 05:44:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 864. [2019-09-09 05:44:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-09-09 05:44:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1230 transitions. [2019-09-09 05:44:25,548 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1230 transitions. Word has length 176 [2019-09-09 05:44:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:25,549 INFO L475 AbstractCegarLoop]: Abstraction has 864 states and 1230 transitions. [2019-09-09 05:44:25,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1230 transitions. [2019-09-09 05:44:25,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-09 05:44:25,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:25,552 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:25,553 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:25,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:25,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1797193209, now seen corresponding path program 1 times [2019-09-09 05:44:25,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:25,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:25,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:25,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:25,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-09-09 05:44:25,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:25,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:25,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:25,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:25,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:25,619 INFO L87 Difference]: Start difference. First operand 864 states and 1230 transitions. Second operand 3 states. [2019-09-09 05:44:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:25,799 INFO L93 Difference]: Finished difference Result 1020 states and 1434 transitions. [2019-09-09 05:44:25,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:25,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-09 05:44:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:25,817 INFO L225 Difference]: With dead ends: 1020 [2019-09-09 05:44:25,817 INFO L226 Difference]: Without dead ends: 993 [2019-09-09 05:44:25,818 INFO L628 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-09-09 05:44:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-09-09 05:44:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 957. [2019-09-09 05:44:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-09-09 05:44:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1362 transitions. [2019-09-09 05:44:25,841 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1362 transitions. Word has length 200 [2019-09-09 05:44:25,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:25,841 INFO L475 AbstractCegarLoop]: Abstraction has 957 states and 1362 transitions. [2019-09-09 05:44:25,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1362 transitions. [2019-09-09 05:44:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-09 05:44:25,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:25,845 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:25,846 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash -737705851, now seen corresponding path program 1 times [2019-09-09 05:44:25,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:25,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:25,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:25,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:25,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-09 05:44:25,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:25,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:25,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:25,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:25,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:25,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:25,939 INFO L87 Difference]: Start difference. First operand 957 states and 1362 transitions. Second operand 3 states. [2019-09-09 05:44:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:25,975 INFO L93 Difference]: Finished difference Result 1898 states and 2700 transitions. [2019-09-09 05:44:25,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:25,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-09 05:44:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:25,989 INFO L225 Difference]: With dead ends: 1898 [2019-09-09 05:44:25,990 INFO L226 Difference]: Without dead ends: 1898 [2019-09-09 05:44:25,991 INFO L628 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-09-09 05:44:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-09-09 05:44:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2019-09-09 05:44:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-09-09 05:44:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2699 transitions. [2019-09-09 05:44:26,052 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2699 transitions. Word has length 230 [2019-09-09 05:44:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:26,053 INFO L475 AbstractCegarLoop]: Abstraction has 1896 states and 2699 transitions. [2019-09-09 05:44:26,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:26,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2699 transitions. [2019-09-09 05:44:26,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-09 05:44:26,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:26,063 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:26,063 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:26,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:26,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1953859577, now seen corresponding path program 1 times [2019-09-09 05:44:26,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:26,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:26,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:26,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-09-09 05:44:26,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:26,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:26,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:26,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:26,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:26,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:26,196 INFO L87 Difference]: Start difference. First operand 1896 states and 2699 transitions. Second operand 3 states. [2019-09-09 05:44:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:26,446 INFO L93 Difference]: Finished difference Result 2202 states and 3119 transitions. [2019-09-09 05:44:26,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:26,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-09 05:44:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:26,458 INFO L225 Difference]: With dead ends: 2202 [2019-09-09 05:44:26,458 INFO L226 Difference]: Without dead ends: 2172 [2019-09-09 05:44:26,459 INFO L628 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-09-09 05:44:26,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2019-09-09 05:44:26,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2106. [2019-09-09 05:44:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2019-09-09 05:44:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3011 transitions. [2019-09-09 05:44:26,527 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 3011 transitions. Word has length 230 [2019-09-09 05:44:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:26,528 INFO L475 AbstractCegarLoop]: Abstraction has 2106 states and 3011 transitions. [2019-09-09 05:44:26,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 3011 transitions. [2019-09-09 05:44:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-09 05:44:26,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:26,535 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:44:26,535 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:26,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:26,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1547041617, now seen corresponding path program 1 times [2019-09-09 05:44:26,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:26,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:26,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:26,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:26,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2019-09-09 05:44:26,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:26,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:26,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:26,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:26,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:26,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:26,695 INFO L87 Difference]: Start difference. First operand 2106 states and 3011 transitions. Second operand 3 states. [2019-09-09 05:44:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:26,861 INFO L93 Difference]: Finished difference Result 2172 states and 3053 transitions. [2019-09-09 05:44:26,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:26,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-09 05:44:26,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:26,872 INFO L225 Difference]: With dead ends: 2172 [2019-09-09 05:44:26,872 INFO L226 Difference]: Without dead ends: 2154 [2019-09-09 05:44:26,873 INFO L628 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-09-09 05:44:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2019-09-09 05:44:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2088. [2019-09-09 05:44:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-09-09 05:44:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2957 transitions. [2019-09-09 05:44:26,922 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2957 transitions. Word has length 265 [2019-09-09 05:44:26,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:26,923 INFO L475 AbstractCegarLoop]: Abstraction has 2088 states and 2957 transitions. [2019-09-09 05:44:26,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:26,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2957 transitions. [2019-09-09 05:44:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-09 05:44:26,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:26,932 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:44:26,932 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:26,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:26,932 INFO L82 PathProgramCache]: Analyzing trace with hash 873507993, now seen corresponding path program 1 times [2019-09-09 05:44:26,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:26,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:26,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:26,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2019-09-09 05:44:27,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:27,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:27,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:27,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:27,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:27,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:27,117 INFO L87 Difference]: Start difference. First operand 2088 states and 2957 transitions. Second operand 3 states. [2019-09-09 05:44:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:27,152 INFO L93 Difference]: Finished difference Result 4145 states and 5854 transitions. [2019-09-09 05:44:27,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:27,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2019-09-09 05:44:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:27,170 INFO L225 Difference]: With dead ends: 4145 [2019-09-09 05:44:27,171 INFO L226 Difference]: Without dead ends: 4145 [2019-09-09 05:44:27,171 INFO L628 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-09-09 05:44:27,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2019-09-09 05:44:27,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 4143. [2019-09-09 05:44:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2019-09-09 05:44:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5853 transitions. [2019-09-09 05:44:27,258 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5853 transitions. Word has length 275 [2019-09-09 05:44:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:27,258 INFO L475 AbstractCegarLoop]: Abstraction has 4143 states and 5853 transitions. [2019-09-09 05:44:27,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5853 transitions. [2019-09-09 05:44:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-09 05:44:27,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:27,268 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:44:27,268 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:27,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:27,269 INFO L82 PathProgramCache]: Analyzing trace with hash 776049309, now seen corresponding path program 1 times [2019-09-09 05:44:27,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:27,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:27,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:27,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:27,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-09 05:44:27,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:27,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:27,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:27,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:27,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:27,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:27,382 INFO L87 Difference]: Start difference. First operand 4143 states and 5853 transitions. Second operand 3 states. [2019-09-09 05:44:27,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:27,563 INFO L93 Difference]: Finished difference Result 4251 states and 5877 transitions. [2019-09-09 05:44:27,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:27,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2019-09-09 05:44:27,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:27,582 INFO L225 Difference]: With dead ends: 4251 [2019-09-09 05:44:27,582 INFO L226 Difference]: Without dead ends: 4251 [2019-09-09 05:44:27,584 INFO L628 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-09-09 05:44:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2019-09-09 05:44:27,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 4143. [2019-09-09 05:44:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2019-09-09 05:44:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5745 transitions. [2019-09-09 05:44:27,670 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5745 transitions. Word has length 275 [2019-09-09 05:44:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:27,671 INFO L475 AbstractCegarLoop]: Abstraction has 4143 states and 5745 transitions. [2019-09-09 05:44:27,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5745 transitions. [2019-09-09 05:44:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-09 05:44:27,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:27,681 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:44:27,681 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:27,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:27,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1838373004, now seen corresponding path program 1 times [2019-09-09 05:44:27,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:27,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:27,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:27,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:27,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-09-09 05:44:27,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:27,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:27,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:27,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:27,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:27,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:27,863 INFO L87 Difference]: Start difference. First operand 4143 states and 5745 transitions. Second operand 3 states. [2019-09-09 05:44:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:28,028 INFO L93 Difference]: Finished difference Result 4737 states and 6423 transitions. [2019-09-09 05:44:28,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:28,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-09 05:44:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:28,049 INFO L225 Difference]: With dead ends: 4737 [2019-09-09 05:44:28,050 INFO L226 Difference]: Without dead ends: 4737 [2019-09-09 05:44:28,050 INFO L628 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-09-09 05:44:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2019-09-09 05:44:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4317. [2019-09-09 05:44:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4317 states. [2019-09-09 05:44:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 5979 transitions. [2019-09-09 05:44:28,135 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 5979 transitions. Word has length 302 [2019-09-09 05:44:28,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:28,136 INFO L475 AbstractCegarLoop]: Abstraction has 4317 states and 5979 transitions. [2019-09-09 05:44:28,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 5979 transitions. [2019-09-09 05:44:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-09 05:44:28,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:28,151 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:44:28,151 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:28,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:28,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1702310885, now seen corresponding path program 1 times [2019-09-09 05:44:28,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:28,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:28,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:28,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:28,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-09-09 05:44:28,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:28,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:28,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:28,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:28,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:28,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:28,269 INFO L87 Difference]: Start difference. First operand 4317 states and 5979 transitions. Second operand 3 states. [2019-09-09 05:44:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:28,424 INFO L93 Difference]: Finished difference Result 4641 states and 6267 transitions. [2019-09-09 05:44:28,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:28,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-09-09 05:44:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:28,457 INFO L225 Difference]: With dead ends: 4641 [2019-09-09 05:44:28,460 INFO L226 Difference]: Without dead ends: 4137 [2019-09-09 05:44:28,461 INFO L628 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-09-09 05:44:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2019-09-09 05:44:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 4119. [2019-09-09 05:44:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4119 states. [2019-09-09 05:44:28,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4119 states to 4119 states and 5685 transitions. [2019-09-09 05:44:28,539 INFO L78 Accepts]: Start accepts. Automaton has 4119 states and 5685 transitions. Word has length 303 [2019-09-09 05:44:28,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:28,539 INFO L475 AbstractCegarLoop]: Abstraction has 4119 states and 5685 transitions. [2019-09-09 05:44:28,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:28,540 INFO L276 IsEmpty]: Start isEmpty. Operand 4119 states and 5685 transitions. [2019-09-09 05:44:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-09 05:44:28,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:28,587 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:44:28,587 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:28,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:28,589 INFO L82 PathProgramCache]: Analyzing trace with hash 485612073, now seen corresponding path program 1 times [2019-09-09 05:44:28,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:28,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:28,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:28,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:28,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-09 05:44:28,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:28,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:44:28,716 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2019-09-09 05:44:28,718 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [30], [39], [41], [44], [46], [51], [56], [61], [66], [69], [71], [76], [79], [81], [86], [89], [91], [96], [99], [101], [106], [109], [111], [116], [119], [121], [126], [131], [136], [141], [146], [149], [151], [156], [161], [166], [169], [171], [176], [179], [181], [186], [191], [196], [199], [209], [211], [214], [222], [237], [243], [248], [250], [253], [261], [264], [269], [272], [274], [277], [285], [288], [290], [292], [298], [301], [309], [311], [313], [316], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [451], [453], [519], [521], [534], [542], [546], [547], [548], [550] [2019-09-09 05:44:28,760 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:28,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:28,879 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:30,635 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:44:30,638 INFO L272 AbstractInterpreter]: Visited 108 different actions 2116 times. Merged at 90 different actions 1714 times. Widened at 16 different actions 222 times. Performed 5252 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5252 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 271 fixpoints after 42 different actions. Largest state had 92 variables. [2019-09-09 05:44:30,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:30,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:44:30,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:30,643 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-09-09 05:44:30,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:30,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:44:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:30,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:44:30,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:30,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2019-09-09 05:44:30,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2019-09-09 05:44:31,023 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:44:31,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:44:31,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:31,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:31,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:31,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:31,025 INFO L87 Difference]: Start difference. First operand 4119 states and 5685 transitions. Second operand 3 states. [2019-09-09 05:44:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:31,072 INFO L93 Difference]: Finished difference Result 4139 states and 5686 transitions. [2019-09-09 05:44:31,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:31,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-09-09 05:44:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:31,084 INFO L225 Difference]: With dead ends: 4139 [2019-09-09 05:44:31,084 INFO L226 Difference]: Without dead ends: 4121 [2019-09-09 05:44:31,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 626 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-09-09 05:44:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4121 states. [2019-09-09 05:44:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4121 to 4107. [2019-09-09 05:44:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4107 states. [2019-09-09 05:44:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4107 states to 4107 states and 5649 transitions. [2019-09-09 05:44:31,178 INFO L78 Accepts]: Start accepts. Automaton has 4107 states and 5649 transitions. Word has length 313 [2019-09-09 05:44:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:31,179 INFO L475 AbstractCegarLoop]: Abstraction has 4107 states and 5649 transitions. [2019-09-09 05:44:31,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5649 transitions. [2019-09-09 05:44:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-09 05:44:31,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:31,190 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:44:31,190 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:31,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:31,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1319826261, now seen corresponding path program 1 times [2019-09-09 05:44:31,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:31,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:31,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:31,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:31,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-09 05:44:31,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:31,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:44:31,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2019-09-09 05:44:31,319 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [30], [39], [41], [44], [46], [51], [56], [61], [66], [69], [71], [76], [79], [81], [86], [89], [91], [96], [99], [101], [106], [109], [111], [116], [119], [121], [126], [131], [136], [141], [146], [149], [151], [156], [161], [166], [169], [171], [176], [179], [181], [186], [191], [196], [199], [209], [211], [214], [222], [237], [243], [248], [250], [253], [261], [264], [269], [272], [274], [277], [285], [290], [292], [298], [301], [309], [311], [313], [316], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [451], [453], [519], [521], [534], [542], [546], [547], [548], [550] [2019-09-09 05:44:31,324 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:31,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:31,338 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:32,810 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:44:32,810 INFO L272 AbstractInterpreter]: Visited 107 different actions 2182 times. Merged at 90 different actions 1769 times. Widened at 17 different actions 233 times. Performed 5431 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5431 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 284 fixpoints after 41 different actions. Largest state had 92 variables. [2019-09-09 05:44:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:32,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:44:32,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:32,811 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:44:32,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:32,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:44:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:32,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:44:32,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-09 05:44:32,997 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-09 05:44:33,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:44:33,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:44:33,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:44:33,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:44:33,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:44:33,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:33,100 INFO L87 Difference]: Start difference. First operand 4107 states and 5649 transitions. Second operand 4 states. [2019-09-09 05:44:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:33,405 INFO L93 Difference]: Finished difference Result 5260 states and 7176 transitions. [2019-09-09 05:44:33,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:33,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2019-09-09 05:44:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:33,417 INFO L225 Difference]: With dead ends: 5260 [2019-09-09 05:44:33,417 INFO L226 Difference]: Without dead ends: 5092 [2019-09-09 05:44:33,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 626 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-09-09 05:44:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5092 states. [2019-09-09 05:44:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5092 to 4280. [2019-09-09 05:44:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2019-09-09 05:44:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5914 transitions. [2019-09-09 05:44:33,494 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5914 transitions. Word has length 313 [2019-09-09 05:44:33,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:33,495 INFO L475 AbstractCegarLoop]: Abstraction has 4280 states and 5914 transitions. [2019-09-09 05:44:33,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:44:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5914 transitions. [2019-09-09 05:44:33,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-09 05:44:33,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:33,506 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:44:33,506 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:33,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2043908506, now seen corresponding path program 1 times [2019-09-09 05:44:33,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:33,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:33,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-09 05:44:33,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:33,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:44:33,687 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 315 with the following transitions: [2019-09-09 05:44:33,692 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [39], [41], [44], [46], [51], [56], [61], [66], [69], [71], [76], [79], [81], [86], [89], [91], [96], [99], [101], [106], [109], [111], [116], [119], [121], [126], [131], [136], [141], [146], [149], [151], [156], [161], [166], [169], [171], [176], [179], [181], [186], [191], [196], [199], [209], [211], [214], [222], [237], [243], [248], [250], [253], [261], [264], [269], [272], [274], [277], [285], [288], [292], [298], [301], [309], [311], [313], [316], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [416], [421], [426], [451], [453], [519], [521], [534], [542], [546], [547], [548], [550] [2019-09-09 05:44:33,710 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:33,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:33,735 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:35,157 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:44:35,162 INFO L272 AbstractInterpreter]: Visited 108 different actions 2023 times. Merged at 92 different actions 1648 times. Widened at 17 different actions 218 times. Performed 5116 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5116 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 248 fixpoints after 33 different actions. Largest state had 92 variables. [2019-09-09 05:44:35,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:35,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:44:35,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:35,163 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-09-09 05:44:35,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:35,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:44:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:35,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:44:35,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-09 05:44:35,418 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-09 05:44:35,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:44:35,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:44:35,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:44:35,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:44:35,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:44:35,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:35,502 INFO L87 Difference]: Start difference. First operand 4280 states and 5914 transitions. Second operand 4 states. [2019-09-09 05:44:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:35,710 INFO L93 Difference]: Finished difference Result 3369 states and 4577 transitions. [2019-09-09 05:44:35,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:44:35,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-09 05:44:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:35,715 INFO L225 Difference]: With dead ends: 3369 [2019-09-09 05:44:35,716 INFO L226 Difference]: Without dead ends: 2213 [2019-09-09 05:44:35,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 628 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-09-09 05:44:35,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2019-09-09 05:44:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 2213. [2019-09-09 05:44:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2019-09-09 05:44:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 3071 transitions. [2019-09-09 05:44:35,750 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 3071 transitions. Word has length 314 [2019-09-09 05:44:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:35,750 INFO L475 AbstractCegarLoop]: Abstraction has 2213 states and 3071 transitions. [2019-09-09 05:44:35,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:44:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3071 transitions. [2019-09-09 05:44:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-09 05:44:35,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:35,757 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 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, 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-09-09 05:44:35,758 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:35,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:35,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1619434322, now seen corresponding path program 1 times [2019-09-09 05:44:35,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:35,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:35,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-09-09 05:44:35,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:35,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:44:35,880 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2019-09-09 05:44:35,880 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [30], [39], [41], [44], [46], [51], [56], [61], [66], [69], [71], [76], [79], [81], [86], [89], [91], [96], [99], [101], [106], [109], [111], [116], [119], [121], [126], [131], [136], [141], [146], [149], [151], [156], [161], [166], [169], [171], [176], [179], [181], [186], [191], [196], [199], [209], [211], [214], [222], [237], [243], [248], [250], [253], [255], [261], [264], [269], [272], [274], [277], [285], [290], [292], [298], [301], [309], [311], [313], [316], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [451], [453], [519], [521], [534], [542], [546], [547], [548], [550] [2019-09-09 05:44:35,882 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:35,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:35,895 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:37,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:44:37,125 INFO L272 AbstractInterpreter]: Visited 108 different actions 1971 times. Merged at 94 different actions 1589 times. Widened at 17 different actions 205 times. Performed 5046 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5046 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 268 fixpoints after 43 different actions. Largest state had 92 variables. [2019-09-09 05:44:37,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:37,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:44:37,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:37,126 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-09-09 05:44:37,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:37,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:44:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:37,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:44:37,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-09-09 05:44:37,297 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:44:37,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:44:37,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:44:37,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:44:37,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:44:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:44:37,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:37,395 INFO L87 Difference]: Start difference. First operand 2213 states and 3071 transitions. Second operand 4 states. [2019-09-09 05:44:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:37,607 INFO L93 Difference]: Finished difference Result 1057 states and 1410 transitions. [2019-09-09 05:44:37,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:44:37,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-09-09 05:44:37,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:37,608 INFO L225 Difference]: With dead ends: 1057 [2019-09-09 05:44:37,608 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:44:37,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 678 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-09-09 05:44:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:44:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:44:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:44:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:44:37,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 339 [2019-09-09 05:44:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:37,610 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:44:37,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:44:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:44:37,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:44:37,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:44:37 BoogieIcfgContainer [2019-09-09 05:44:37,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:44:37,624 INFO L168 Benchmark]: Toolchain (without parser) took 16428.61 ms. Allocated memory was 137.9 MB in the beginning and 845.7 MB in the end (delta: 707.8 MB). Free memory was 84.9 MB in the beginning and 375.6 MB in the end (delta: -290.8 MB). Peak memory consumption was 417.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:37,625 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 104.1 MB in the beginning and 103.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:44:37,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.52 ms. Allocated memory was 137.9 MB in the beginning and 198.7 MB in the end (delta: 60.8 MB). Free memory was 84.7 MB in the beginning and 172.3 MB in the end (delta: -87.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:37,627 INFO L168 Benchmark]: Boogie Preprocessor took 54.63 ms. Allocated memory is still 198.7 MB. Free memory was 172.3 MB in the beginning and 169.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:37,631 INFO L168 Benchmark]: RCFGBuilder took 732.55 ms. Allocated memory is still 198.7 MB. Free memory was 169.7 MB in the beginning and 126.6 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:37,632 INFO L168 Benchmark]: TraceAbstraction took 14991.13 ms. Allocated memory was 198.7 MB in the beginning and 845.7 MB in the end (delta: 647.0 MB). Free memory was 125.9 MB in the beginning and 375.6 MB in the end (delta: -249.7 MB). Peak memory consumption was 397.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:37,644 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.24 ms. Allocated memory is still 137.9 MB. Free memory was 104.1 MB in the beginning and 103.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 644.52 ms. Allocated memory was 137.9 MB in the beginning and 198.7 MB in the end (delta: 60.8 MB). Free memory was 84.7 MB in the beginning and 172.3 MB in the end (delta: -87.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.63 ms. Allocated memory is still 198.7 MB. Free memory was 172.3 MB in the beginning and 169.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 732.55 ms. Allocated memory is still 198.7 MB. Free memory was 169.7 MB in the beginning and 126.6 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14991.13 ms. Allocated memory was 198.7 MB in the beginning and 845.7 MB in the end (delta: 647.0 MB). Free memory was 125.9 MB in the beginning and 375.6 MB in the end (delta: -249.7 MB). Peak memory consumption was 397.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 613]: 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, 134 locations, 1 error locations. SAFE Result, 14.9s OverallTime, 21 OverallIterations, 15 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4162 SDtfs, 1585 SDslu, 2415 SDs, 0 SdLazy, 1977 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2627 GetRequests, 2592 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4317occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.1s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 1655 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 5501 NumberOfCodeBlocks, 5501 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 6751 ConstructedInterpolants, 0 QuantifiedInterpolants, 2777883 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2483 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 29 InterpolantComputations, 19 PerfectInterpolantSequences, 20845/20944 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...