/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:13:23,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:13:23,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:13:23,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:13:23,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:13:23,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:13:23,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:13:23,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:13:23,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:13:23,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:13:23,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:13:23,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:13:23,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:13:23,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:13:23,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:13:23,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:13:23,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:13:23,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:13:23,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:13:23,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:13:23,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:13:23,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:13:23,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:13:23,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:13:23,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:13:23,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:13:23,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:13:23,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:13:23,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:13:23,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:13:23,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:13:23,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:13:23,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:13:23,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:13:23,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:13:23,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:13:23,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:13:23,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:13:23,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:13:23,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:13:23,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:13:23,169 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 01:13:23,193 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:13:23,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:13:23,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:13:23,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:13:23,196 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:13:23,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:13:23,196 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:13:23,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:13:23,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:13:23,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:13:23,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:13:23,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:13:23,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:13:23,199 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:13:23,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:13:23,200 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:13:23,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:13:23,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:13:23,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:13:23,201 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:13:23,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:13:23,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:13:23,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:13:23,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:13:23,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:13:23,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:13:23,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:13:23,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:13:23,203 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:13:23,481 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:13:23,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:13:23,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:13:23,506 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:13:23,506 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:13:23,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-1.c [2019-11-07 01:13:23,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001113066/802fb7b95c9744ff9c673905edd25f58/FLAG1829ff515 [2019-11-07 01:13:24,141 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:13:24,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-1.c [2019-11-07 01:13:24,160 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001113066/802fb7b95c9744ff9c673905edd25f58/FLAG1829ff515 [2019-11-07 01:13:24,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001113066/802fb7b95c9744ff9c673905edd25f58 [2019-11-07 01:13:24,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:13:24,465 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:13:24,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:13:24,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:13:24,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:13:24,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:13:24" (1/1) ... [2019-11-07 01:13:24,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a8be27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24, skipping insertion in model container [2019-11-07 01:13:24,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:13:24" (1/1) ... [2019-11-07 01:13:24,493 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:13:24,615 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:13:24,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:13:24,974 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:13:25,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:13:25,158 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:13:25,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:25 WrapperNode [2019-11-07 01:13:25,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:13:25,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:13:25,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:13:25,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:13:25,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:25" (1/1) ... [2019-11-07 01:13:25,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:25" (1/1) ... [2019-11-07 01:13:25,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:25" (1/1) ... [2019-11-07 01:13:25,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:25" (1/1) ... [2019-11-07 01:13:25,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:25" (1/1) ... [2019-11-07 01:13:25,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:25" (1/1) ... [2019-11-07 01:13:25,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:25" (1/1) ... [2019-11-07 01:13:25,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:13:25,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:13:25,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:13:25,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:13:25,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:25" (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-11-07 01:13:25,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:13:25,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:13:25,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-11-07 01:13:25,311 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:13:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:13:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:13:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:13:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 01:13:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 01:13:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-11-07 01:13:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:13:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:13:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:13:25,471 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 01:13:26,007 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-07 01:13:26,008 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-07 01:13:26,020 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:13:26,021 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 01:13:26,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:26 BoogieIcfgContainer [2019-11-07 01:13:26,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:13:26,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:13:26,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:13:26,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:13:26,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:13:24" (1/3) ... [2019-11-07 01:13:26,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55786d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:26, skipping insertion in model container [2019-11-07 01:13:26,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:25" (2/3) ... [2019-11-07 01:13:26,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55786d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:26, skipping insertion in model container [2019-11-07 01:13:26,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:26" (3/3) ... [2019-11-07 01:13:26,032 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2019-11-07 01:13:26,043 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:13:26,053 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:13:26,066 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:13:26,095 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:13:26,095 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:13:26,096 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:13:26,096 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:13:26,096 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:13:26,096 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:13:26,097 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:13:26,097 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:13:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-11-07 01:13:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 01:13:26,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:26,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:26,143 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:26,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:26,149 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-11-07 01:13:26,158 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:26,159 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962573342] [2019-11-07 01:13:26,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:26,417 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962573342] [2019-11-07 01:13:26,418 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:26,418 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:26,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954006032] [2019-11-07 01:13:26,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:26,427 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:26,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:26,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:26,444 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-11-07 01:13:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:26,573 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-11-07 01:13:26,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:26,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-07 01:13:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:26,593 INFO L225 Difference]: With dead ends: 377 [2019-11-07 01:13:26,593 INFO L226 Difference]: Without dead ends: 220 [2019-11-07 01:13:26,603 INFO L630 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-11-07 01:13:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-07 01:13:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-11-07 01:13:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-07 01:13:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-11-07 01:13:26,739 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-11-07 01:13:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:26,739 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-11-07 01:13:26,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-11-07 01:13:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 01:13:26,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:26,748 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:26,749 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:26,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:26,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2019-11-07 01:13:26,750 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:26,750 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522895565] [2019-11-07 01:13:26,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:26,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:26,906 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522895565] [2019-11-07 01:13:26,906 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:26,906 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:26,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743970706] [2019-11-07 01:13:26,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:26,908 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:26,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:26,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:26,909 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-11-07 01:13:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:27,126 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2019-11-07 01:13:27,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:27,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-07 01:13:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:27,130 INFO L225 Difference]: With dead ends: 470 [2019-11-07 01:13:27,131 INFO L226 Difference]: Without dead ends: 262 [2019-11-07 01:13:27,133 INFO L630 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-11-07 01:13:27,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-07 01:13:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2019-11-07 01:13:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-07 01:13:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-11-07 01:13:27,164 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-11-07 01:13:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:27,165 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-11-07 01:13:27,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-11-07 01:13:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:13:27,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:27,170 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:27,173 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:27,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:27,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1578262845, now seen corresponding path program 1 times [2019-11-07 01:13:27,174 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:27,175 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102365240] [2019-11-07 01:13:27,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:13:27,296 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102365240] [2019-11-07 01:13:27,296 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:27,296 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:27,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564393096] [2019-11-07 01:13:27,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:27,298 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:27,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:27,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:27,298 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-11-07 01:13:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:27,555 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-11-07 01:13:27,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:27,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-07 01:13:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:27,560 INFO L225 Difference]: With dead ends: 598 [2019-11-07 01:13:27,560 INFO L226 Difference]: Without dead ends: 354 [2019-11-07 01:13:27,562 INFO L630 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-11-07 01:13:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-07 01:13:27,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-11-07 01:13:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-07 01:13:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-11-07 01:13:27,592 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-11-07 01:13:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:27,592 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-11-07 01:13:27,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-11-07 01:13:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:13:27,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:27,595 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:27,596 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:27,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:27,596 INFO L82 PathProgramCache]: Analyzing trace with hash -227175489, now seen corresponding path program 1 times [2019-11-07 01:13:27,596 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:27,597 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600885915] [2019-11-07 01:13:27,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:13:27,653 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600885915] [2019-11-07 01:13:27,653 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:27,653 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:27,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147008048] [2019-11-07 01:13:27,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:27,654 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:27,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:27,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:27,655 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-11-07 01:13:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:27,832 INFO L93 Difference]: Finished difference Result 710 states and 1008 transitions. [2019-11-07 01:13:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:27,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-07 01:13:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:27,840 INFO L225 Difference]: With dead ends: 710 [2019-11-07 01:13:27,840 INFO L226 Difference]: Without dead ends: 386 [2019-11-07 01:13:27,841 INFO L630 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-11-07 01:13:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-07 01:13:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 374. [2019-11-07 01:13:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-07 01:13:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-11-07 01:13:27,861 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-11-07 01:13:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:27,862 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-11-07 01:13:27,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-11-07 01:13:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-07 01:13:27,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:27,871 INFO L410 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-11-07 01:13:27,872 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1103228957, now seen corresponding path program 1 times [2019-11-07 01:13:27,873 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:27,873 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005638669] [2019-11-07 01:13:27,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:13:27,987 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005638669] [2019-11-07 01:13:27,988 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:27,988 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:27,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053395787] [2019-11-07 01:13:27,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:27,990 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:27,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:27,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:27,991 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-11-07 01:13:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:28,190 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-11-07 01:13:28,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:28,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-07 01:13:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:28,194 INFO L225 Difference]: With dead ends: 842 [2019-11-07 01:13:28,194 INFO L226 Difference]: Without dead ends: 478 [2019-11-07 01:13:28,195 INFO L630 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-11-07 01:13:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-07 01:13:28,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-11-07 01:13:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-07 01:13:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-11-07 01:13:28,212 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-11-07 01:13:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:28,212 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-11-07 01:13:28,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-11-07 01:13:28,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-07 01:13:28,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:28,215 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:28,215 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:28,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:28,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1629529054, now seen corresponding path program 1 times [2019-11-07 01:13:28,216 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:28,216 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536556251] [2019-11-07 01:13:28,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-07 01:13:28,279 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536556251] [2019-11-07 01:13:28,280 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:28,280 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:28,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447837899] [2019-11-07 01:13:28,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:28,281 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:28,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:28,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:28,282 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-11-07 01:13:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:28,420 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-11-07 01:13:28,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:28,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-07 01:13:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:28,424 INFO L225 Difference]: With dead ends: 940 [2019-11-07 01:13:28,425 INFO L226 Difference]: Without dead ends: 500 [2019-11-07 01:13:28,426 INFO L630 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-11-07 01:13:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-07 01:13:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-11-07 01:13:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-07 01:13:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-11-07 01:13:28,443 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-11-07 01:13:28,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:28,443 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-11-07 01:13:28,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-11-07 01:13:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-07 01:13:28,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:28,446 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:28,446 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:28,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:28,446 INFO L82 PathProgramCache]: Analyzing trace with hash -233915046, now seen corresponding path program 1 times [2019-11-07 01:13:28,447 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:28,447 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032097941] [2019-11-07 01:13:28,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 01:13:28,525 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032097941] [2019-11-07 01:13:28,525 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:28,525 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:28,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544324257] [2019-11-07 01:13:28,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:28,528 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:28,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:28,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:28,529 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-11-07 01:13:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:28,571 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-11-07 01:13:28,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:28,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-07 01:13:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:28,576 INFO L225 Difference]: With dead ends: 976 [2019-11-07 01:13:28,576 INFO L226 Difference]: Without dead ends: 734 [2019-11-07 01:13:28,577 INFO L630 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-11-07 01:13:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-11-07 01:13:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-11-07 01:13:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-11-07 01:13:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-11-07 01:13:28,601 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-11-07 01:13:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:28,601 INFO L462 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-11-07 01:13:28,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-11-07 01:13:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-07 01:13:28,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:28,604 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:28,604 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:28,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:28,605 INFO L82 PathProgramCache]: Analyzing trace with hash -674483159, now seen corresponding path program 1 times [2019-11-07 01:13:28,605 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:28,605 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645385726] [2019-11-07 01:13:28,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-07 01:13:28,687 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645385726] [2019-11-07 01:13:28,687 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:28,687 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:28,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086818917] [2019-11-07 01:13:28,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:28,688 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:28,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:28,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:28,689 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-11-07 01:13:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:28,731 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-11-07 01:13:28,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:28,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-07 01:13:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:28,738 INFO L225 Difference]: With dead ends: 976 [2019-11-07 01:13:28,738 INFO L226 Difference]: Without dead ends: 974 [2019-11-07 01:13:28,740 INFO L630 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-11-07 01:13:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-11-07 01:13:28,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-11-07 01:13:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-11-07 01:13:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-11-07 01:13:28,770 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-11-07 01:13:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:28,770 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-11-07 01:13:28,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-11-07 01:13:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-07 01:13:28,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:28,774 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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] [2019-11-07 01:13:28,774 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:28,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:28,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2095197958, now seen corresponding path program 1 times [2019-11-07 01:13:28,775 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:28,775 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005636963] [2019-11-07 01:13:28,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-07 01:13:28,832 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005636963] [2019-11-07 01:13:28,833 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:28,833 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:28,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376775496] [2019-11-07 01:13:28,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:28,834 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:28,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:28,835 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-11-07 01:13:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:29,010 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-11-07 01:13:29,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:29,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-07 01:13:29,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:29,017 INFO L225 Difference]: With dead ends: 2140 [2019-11-07 01:13:29,017 INFO L226 Difference]: Without dead ends: 1170 [2019-11-07 01:13:29,020 INFO L630 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-11-07 01:13:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-11-07 01:13:29,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-11-07 01:13:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-11-07 01:13:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-11-07 01:13:29,055 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 139 [2019-11-07 01:13:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:29,056 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-11-07 01:13:29,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-11-07 01:13:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-07 01:13:29,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:29,061 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:29,061 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:29,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:29,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2111242741, now seen corresponding path program 1 times [2019-11-07 01:13:29,062 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:29,062 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762542201] [2019-11-07 01:13:29,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-07 01:13:29,157 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762542201] [2019-11-07 01:13:29,158 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:29,159 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:29,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022332377] [2019-11-07 01:13:29,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:29,161 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:29,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:29,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:29,164 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-11-07 01:13:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:29,319 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-11-07 01:13:29,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:29,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-07 01:13:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:29,327 INFO L225 Difference]: With dead ends: 2354 [2019-11-07 01:13:29,333 INFO L226 Difference]: Without dead ends: 1236 [2019-11-07 01:13:29,341 INFO L630 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-11-07 01:13:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-11-07 01:13:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-11-07 01:13:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-11-07 01:13:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-11-07 01:13:29,383 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 175 [2019-11-07 01:13:29,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:29,383 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-11-07 01:13:29,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-11-07 01:13:29,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-07 01:13:29,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:29,389 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:29,390 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:29,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:29,390 INFO L82 PathProgramCache]: Analyzing trace with hash 834252520, now seen corresponding path program 1 times [2019-11-07 01:13:29,390 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:29,390 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156435080] [2019-11-07 01:13:29,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-07 01:13:29,467 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156435080] [2019-11-07 01:13:29,467 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:29,467 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:29,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799476560] [2019-11-07 01:13:29,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:29,468 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:29,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:29,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:29,469 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-11-07 01:13:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:29,616 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-11-07 01:13:29,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:29,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-11-07 01:13:29,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:29,624 INFO L225 Difference]: With dead ends: 2544 [2019-11-07 01:13:29,624 INFO L226 Difference]: Without dead ends: 1334 [2019-11-07 01:13:29,626 INFO L630 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-11-07 01:13:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-11-07 01:13:29,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-11-07 01:13:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-11-07 01:13:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-11-07 01:13:29,673 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 196 [2019-11-07 01:13:29,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:29,674 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-11-07 01:13:29,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-11-07 01:13:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-07 01:13:29,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:29,681 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:29,681 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:29,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:29,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1654542421, now seen corresponding path program 1 times [2019-11-07 01:13:29,682 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:29,682 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287208541] [2019-11-07 01:13:29,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-11-07 01:13:29,810 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287208541] [2019-11-07 01:13:29,810 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:29,810 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:29,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144933551] [2019-11-07 01:13:29,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:29,811 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:29,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:29,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:29,812 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2019-11-07 01:13:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:29,967 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-11-07 01:13:29,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:29,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-11-07 01:13:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:29,977 INFO L225 Difference]: With dead ends: 2752 [2019-11-07 01:13:29,977 INFO L226 Difference]: Without dead ends: 1442 [2019-11-07 01:13:29,979 INFO L630 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-11-07 01:13:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-11-07 01:13:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-11-07 01:13:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-11-07 01:13:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-11-07 01:13:30,036 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 220 [2019-11-07 01:13:30,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:30,037 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-11-07 01:13:30,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-11-07 01:13:30,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-07 01:13:30,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:30,045 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:30,046 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:30,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:30,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1609383977, now seen corresponding path program 1 times [2019-11-07 01:13:30,047 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:30,047 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325321248] [2019-11-07 01:13:30,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-11-07 01:13:30,196 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325321248] [2019-11-07 01:13:30,196 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:30,196 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:30,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027096455] [2019-11-07 01:13:30,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:30,198 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:30,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:30,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:30,199 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-11-07 01:13:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:30,388 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-11-07 01:13:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:30,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-11-07 01:13:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:30,396 INFO L225 Difference]: With dead ends: 2992 [2019-11-07 01:13:30,396 INFO L226 Difference]: Without dead ends: 1570 [2019-11-07 01:13:30,400 INFO L630 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-11-07 01:13:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-11-07 01:13:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-11-07 01:13:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-11-07 01:13:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-11-07 01:13:30,444 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 220 [2019-11-07 01:13:30,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:30,445 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-11-07 01:13:30,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-11-07 01:13:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-07 01:13:30,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:30,451 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:30,452 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:30,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:30,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1500640469, now seen corresponding path program 1 times [2019-11-07 01:13:30,453 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:30,454 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305416472] [2019-11-07 01:13:30,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-11-07 01:13:30,559 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305416472] [2019-11-07 01:13:30,559 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:30,559 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:30,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446168167] [2019-11-07 01:13:30,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:30,560 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:30,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:30,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:30,561 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-11-07 01:13:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:30,617 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-11-07 01:13:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:30,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-11-07 01:13:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:30,633 INFO L225 Difference]: With dead ends: 4646 [2019-11-07 01:13:30,633 INFO L226 Difference]: Without dead ends: 3100 [2019-11-07 01:13:30,639 INFO L630 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-11-07 01:13:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-11-07 01:13:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-11-07 01:13:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-11-07 01:13:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-11-07 01:13:30,721 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 250 [2019-11-07 01:13:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:30,721 INFO L462 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-11-07 01:13:30,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-11-07 01:13:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-07 01:13:30,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:30,730 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:30,730 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:30,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:30,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1763285929, now seen corresponding path program 1 times [2019-11-07 01:13:30,731 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:30,731 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329404825] [2019-11-07 01:13:30,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-11-07 01:13:30,866 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329404825] [2019-11-07 01:13:30,866 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:30,866 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:30,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307541612] [2019-11-07 01:13:30,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:30,867 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:30,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:30,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:30,868 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-11-07 01:13:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:31,073 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-11-07 01:13:31,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:31,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-11-07 01:13:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:31,096 INFO L225 Difference]: With dead ends: 6484 [2019-11-07 01:13:31,097 INFO L226 Difference]: Without dead ends: 3398 [2019-11-07 01:13:31,108 INFO L630 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-11-07 01:13:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-11-07 01:13:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-11-07 01:13:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-11-07 01:13:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-11-07 01:13:31,242 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 250 [2019-11-07 01:13:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:31,243 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-11-07 01:13:31,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-11-07 01:13:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-07 01:13:31,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:31,253 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:31,253 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:31,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:31,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1165577599, now seen corresponding path program 1 times [2019-11-07 01:13:31,254 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:31,254 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934591125] [2019-11-07 01:13:31,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-11-07 01:13:31,469 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934591125] [2019-11-07 01:13:31,472 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:31,472 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:31,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144537210] [2019-11-07 01:13:31,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:31,473 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:31,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:31,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:31,474 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-11-07 01:13:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:31,641 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-11-07 01:13:31,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:31,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-11-07 01:13:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:31,660 INFO L225 Difference]: With dead ends: 6900 [2019-11-07 01:13:31,660 INFO L226 Difference]: Without dead ends: 3530 [2019-11-07 01:13:31,668 INFO L630 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-11-07 01:13:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-11-07 01:13:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-11-07 01:13:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-11-07 01:13:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-11-07 01:13:31,770 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 274 [2019-11-07 01:13:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:31,771 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-11-07 01:13:31,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-11-07 01:13:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-11-07 01:13:31,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:31,780 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:31,781 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:31,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:31,781 INFO L82 PathProgramCache]: Analyzing trace with hash -373875199, now seen corresponding path program 1 times [2019-11-07 01:13:31,781 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:31,782 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917662332] [2019-11-07 01:13:31,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-07 01:13:31,896 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917662332] [2019-11-07 01:13:31,896 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:31,897 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:31,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210316708] [2019-11-07 01:13:31,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:31,897 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:31,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:31,898 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-11-07 01:13:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:32,102 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-11-07 01:13:32,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:32,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2019-11-07 01:13:32,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:32,122 INFO L225 Difference]: With dead ends: 7416 [2019-11-07 01:13:32,122 INFO L226 Difference]: Without dead ends: 3914 [2019-11-07 01:13:32,160 INFO L630 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-11-07 01:13:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-11-07 01:13:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-11-07 01:13:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-11-07 01:13:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-11-07 01:13:32,254 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 285 [2019-11-07 01:13:32,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:32,255 INFO L462 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-11-07 01:13:32,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-11-07 01:13:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-11-07 01:13:32,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:32,265 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:32,265 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:32,266 INFO L82 PathProgramCache]: Analyzing trace with hash -233584477, now seen corresponding path program 1 times [2019-11-07 01:13:32,266 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:32,266 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911162019] [2019-11-07 01:13:32,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-11-07 01:13:32,381 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911162019] [2019-11-07 01:13:32,382 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:32,382 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:32,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645035118] [2019-11-07 01:13:32,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:32,383 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:32,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:32,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:32,383 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-11-07 01:13:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:32,577 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-11-07 01:13:32,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:32,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-11-07 01:13:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:32,596 INFO L225 Difference]: With dead ends: 8048 [2019-11-07 01:13:32,597 INFO L226 Difference]: Without dead ends: 4234 [2019-11-07 01:13:32,604 INFO L630 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-11-07 01:13:32,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-11-07 01:13:32,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-11-07 01:13:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-11-07 01:13:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-11-07 01:13:32,711 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 299 [2019-11-07 01:13:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:32,712 INFO L462 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-11-07 01:13:32,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-11-07 01:13:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-07 01:13:32,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:32,723 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:32,724 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:32,724 INFO L82 PathProgramCache]: Analyzing trace with hash -110745964, now seen corresponding path program 1 times [2019-11-07 01:13:32,724 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:32,724 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328811240] [2019-11-07 01:13:32,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-11-07 01:13:32,939 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328811240] [2019-11-07 01:13:32,939 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:32,939 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:32,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628039929] [2019-11-07 01:13:32,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:32,940 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:32,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:32,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:32,941 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-11-07 01:13:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:33,024 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-11-07 01:13:33,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:33,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-07 01:13:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:33,042 INFO L225 Difference]: With dead ends: 11310 [2019-11-07 01:13:33,042 INFO L226 Difference]: Without dead ends: 7376 [2019-11-07 01:13:33,051 INFO L630 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-11-07 01:13:33,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-11-07 01:13:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-11-07 01:13:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-11-07 01:13:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-11-07 01:13:33,198 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 300 [2019-11-07 01:13:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:33,199 INFO L462 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-11-07 01:13:33,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-11-07 01:13:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-11-07 01:13:33,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:33,213 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:33,214 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:33,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:33,214 INFO L82 PathProgramCache]: Analyzing trace with hash 123119806, now seen corresponding path program 1 times [2019-11-07 01:13:33,214 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:33,214 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326401074] [2019-11-07 01:13:33,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2019-11-07 01:13:33,390 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326401074] [2019-11-07 01:13:33,390 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:33,390 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:33,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013410873] [2019-11-07 01:13:33,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:33,391 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:33,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:33,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:33,392 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-11-07 01:13:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:33,596 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-11-07 01:13:33,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:33,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-11-07 01:13:33,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:33,613 INFO L225 Difference]: With dead ends: 14744 [2019-11-07 01:13:33,613 INFO L226 Difference]: Without dead ends: 7382 [2019-11-07 01:13:33,627 INFO L630 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-11-07 01:13:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-11-07 01:13:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-11-07 01:13:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-11-07 01:13:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-11-07 01:13:33,772 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 301 [2019-11-07 01:13:33,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:33,772 INFO L462 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-11-07 01:13:33,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:33,773 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-11-07 01:13:33,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-07 01:13:33,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:33,787 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:33,787 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:33,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:33,788 INFO L82 PathProgramCache]: Analyzing trace with hash -994522767, now seen corresponding path program 1 times [2019-11-07 01:13:33,788 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:33,788 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200195042] [2019-11-07 01:13:33,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 637 proven. 14 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-07 01:13:33,918 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200195042] [2019-11-07 01:13:33,918 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335879687] [2019-11-07 01:13:33,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:34,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-07 01:13:34,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2019-11-07 01:13:34,243 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2019-11-07 01:13:34,353 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:13:34,353 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 10 [2019-11-07 01:13:34,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860888719] [2019-11-07 01:13:34,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:13:34,354 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:34,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:13:34,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:13:34,355 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 8 states. [2019-11-07 01:13:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:34,862 INFO L93 Difference]: Finished difference Result 14914 states and 19435 transitions. [2019-11-07 01:13:34,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:13:34,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 324 [2019-11-07 01:13:34,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:34,878 INFO L225 Difference]: With dead ends: 14914 [2019-11-07 01:13:34,878 INFO L226 Difference]: Without dead ends: 7548 [2019-11-07 01:13:34,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:13:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7548 states. [2019-11-07 01:13:35,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7548 to 7356. [2019-11-07 01:13:35,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2019-11-07 01:13:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2019-11-07 01:13:35,110 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 324 [2019-11-07 01:13:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:35,111 INFO L462 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2019-11-07 01:13:35,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:13:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2019-11-07 01:13:35,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-11-07 01:13:35,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:35,130 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:35,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:35,339 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:35,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:35,339 INFO L82 PathProgramCache]: Analyzing trace with hash -697717157, now seen corresponding path program 1 times [2019-11-07 01:13:35,339 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:35,340 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054746675] [2019-11-07 01:13:35,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-07 01:13:35,577 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054746675] [2019-11-07 01:13:35,577 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002877865] [2019-11-07 01:13:35,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:35,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:35,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-07 01:13:35,798 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-07 01:13:35,890 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1778485050] [2019-11-07 01:13:35,897 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 338 [2019-11-07 01:13:35,952 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:13:35,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:13:36,193 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:13:37,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:13:37,814 INFO L272 AbstractInterpreter]: Visited 110 different actions 2213 times. Merged at 100 different actions 1796 times. Widened at 22 different actions 217 times. Performed 5691 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5691 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 290 fixpoints after 37 different actions. Largest state had 105 variables. [2019-11-07 01:13:37,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:37,821 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:13:37,821 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:13:37,821 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:13:37,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098656155] [2019-11-07 01:13:37,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:13:37,823 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:37,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:13:37,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:37,823 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 6 states. [2019-11-07 01:13:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:38,605 INFO L93 Difference]: Finished difference Result 14768 states and 19241 transitions. [2019-11-07 01:13:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:13:38,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 337 [2019-11-07 01:13:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:38,629 INFO L225 Difference]: With dead ends: 14768 [2019-11-07 01:13:38,629 INFO L226 Difference]: Without dead ends: 11178 [2019-11-07 01:13:38,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:13:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11178 states. [2019-11-07 01:13:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11178 to 8460. [2019-11-07 01:13:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-11-07 01:13:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-11-07 01:13:38,820 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 337 [2019-11-07 01:13:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:38,821 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-11-07 01:13:38,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:13:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-11-07 01:13:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-11-07 01:13:38,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:38,840 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:39,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:39,045 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:39,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:39,045 INFO L82 PathProgramCache]: Analyzing trace with hash 233855425, now seen corresponding path program 2 times [2019-11-07 01:13:39,045 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:39,046 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7212162] [2019-11-07 01:13:39,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 714 proven. 5 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-07 01:13:39,232 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7212162] [2019-11-07 01:13:39,233 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925029728] [2019-11-07 01:13:39,233 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:39,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-07 01:13:39,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 01:13:39,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 01:13:39,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-11-07 01:13:39,453 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-11-07 01:13:39,605 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:13:39,606 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-07 01:13:39,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629094504] [2019-11-07 01:13:39,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:13:39,607 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:39,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:13:39,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:39,608 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 4 states. [2019-11-07 01:13:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:39,930 INFO L93 Difference]: Finished difference Result 17182 states and 22474 transitions. [2019-11-07 01:13:39,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:13:39,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2019-11-07 01:13:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:39,946 INFO L225 Difference]: With dead ends: 17182 [2019-11-07 01:13:39,947 INFO L226 Difference]: Without dead ends: 8740 [2019-11-07 01:13:39,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8740 states. [2019-11-07 01:13:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8740 to 7884. [2019-11-07 01:13:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7884 states. [2019-11-07 01:13:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7884 states to 7884 states and 9925 transitions. [2019-11-07 01:13:40,128 INFO L78 Accepts]: Start accepts. Automaton has 7884 states and 9925 transitions. Word has length 350 [2019-11-07 01:13:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:40,129 INFO L462 AbstractCegarLoop]: Abstraction has 7884 states and 9925 transitions. [2019-11-07 01:13:40,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:13:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 7884 states and 9925 transitions. [2019-11-07 01:13:40,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-11-07 01:13:40,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:40,146 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:40,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:40,352 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:40,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:40,352 INFO L82 PathProgramCache]: Analyzing trace with hash -382228618, now seen corresponding path program 1 times [2019-11-07 01:13:40,353 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:40,353 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105704690] [2019-11-07 01:13:40,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-07 01:13:40,599 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105704690] [2019-11-07 01:13:40,599 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463418533] [2019-11-07 01:13:40,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:40,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:40,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-07 01:13:40,870 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-07 01:13:41,059 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [508451712] [2019-11-07 01:13:41,059 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 382 [2019-11-07 01:13:41,070 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:13:41,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:13:41,129 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:13:42,762 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:13:42,762 INFO L272 AbstractInterpreter]: Visited 112 different actions 2547 times. Merged at 100 different actions 2054 times. Widened at 20 different actions 245 times. Performed 6444 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6444 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 361 fixpoints after 40 different actions. Largest state had 105 variables. [2019-11-07 01:13:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:42,763 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:13:42,763 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:13:42,764 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:13:42,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816149164] [2019-11-07 01:13:42,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:13:42,765 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:42,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:13:42,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:42,766 INFO L87 Difference]: Start difference. First operand 7884 states and 9925 transitions. Second operand 6 states. [2019-11-07 01:13:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:43,254 INFO L93 Difference]: Finished difference Result 17918 states and 22458 transitions. [2019-11-07 01:13:43,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:43,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 381 [2019-11-07 01:13:43,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:43,273 INFO L225 Difference]: With dead ends: 17918 [2019-11-07 01:13:43,273 INFO L226 Difference]: Without dead ends: 10044 [2019-11-07 01:13:43,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 762 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-11-07 01:13:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10044 states. [2019-11-07 01:13:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10044 to 8293. [2019-11-07 01:13:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8293 states. [2019-11-07 01:13:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8293 states to 8293 states and 10415 transitions. [2019-11-07 01:13:43,443 INFO L78 Accepts]: Start accepts. Automaton has 8293 states and 10415 transitions. Word has length 381 [2019-11-07 01:13:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:43,444 INFO L462 AbstractCegarLoop]: Abstraction has 8293 states and 10415 transitions. [2019-11-07 01:13:43,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:13:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 8293 states and 10415 transitions. [2019-11-07 01:13:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-07 01:13:43,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:43,458 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-07 01:13:43,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:43,667 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:43,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:43,668 INFO L82 PathProgramCache]: Analyzing trace with hash 675475598, now seen corresponding path program 1 times [2019-11-07 01:13:43,668 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:43,668 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567732711] [2019-11-07 01:13:43,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-07 01:13:43,836 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567732711] [2019-11-07 01:13:43,836 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:43,836 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:43,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907161988] [2019-11-07 01:13:43,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:43,837 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:43,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:43,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:43,838 INFO L87 Difference]: Start difference. First operand 8293 states and 10415 transitions. Second operand 3 states. [2019-11-07 01:13:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:44,039 INFO L93 Difference]: Finished difference Result 15667 states and 19288 transitions. [2019-11-07 01:13:44,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:44,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-11-07 01:13:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:44,048 INFO L225 Difference]: With dead ends: 15667 [2019-11-07 01:13:44,048 INFO L226 Difference]: Without dead ends: 3877 [2019-11-07 01:13:44,058 INFO L630 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-11-07 01:13:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2019-11-07 01:13:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 3643. [2019-11-07 01:13:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-11-07 01:13:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4533 transitions. [2019-11-07 01:13:44,120 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4533 transitions. Word has length 420 [2019-11-07 01:13:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:44,121 INFO L462 AbstractCegarLoop]: Abstraction has 3643 states and 4533 transitions. [2019-11-07 01:13:44,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4533 transitions. [2019-11-07 01:13:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-11-07 01:13:44,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:44,131 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:44,132 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:44,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:44,132 INFO L82 PathProgramCache]: Analyzing trace with hash 331734252, now seen corresponding path program 1 times [2019-11-07 01:13:44,132 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:44,133 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723713594] [2019-11-07 01:13:44,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-11-07 01:13:44,440 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723713594] [2019-11-07 01:13:44,441 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306352385] [2019-11-07 01:13:44,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:44,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:44,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-11-07 01:13:44,715 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-11-07 01:13:44,836 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [48780667] [2019-11-07 01:13:44,836 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 488 [2019-11-07 01:13:44,839 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:13:44,840 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:13:44,880 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:13:45,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:13:45,977 INFO L272 AbstractInterpreter]: Visited 116 different actions 2300 times. Merged at 104 different actions 1864 times. Widened at 22 different actions 233 times. Performed 6042 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6042 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 304 fixpoints after 38 different actions. Largest state had 106 variables. [2019-11-07 01:13:45,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:45,978 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:13:45,978 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:13:45,978 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:13:45,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678540815] [2019-11-07 01:13:45,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:13:45,980 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:45,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:13:45,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:45,980 INFO L87 Difference]: Start difference. First operand 3643 states and 4533 transitions. Second operand 6 states. [2019-11-07 01:13:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:46,319 INFO L93 Difference]: Finished difference Result 4515 states and 5616 transitions. [2019-11-07 01:13:46,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:46,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 487 [2019-11-07 01:13:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:46,320 INFO L225 Difference]: With dead ends: 4515 [2019-11-07 01:13:46,320 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 01:13:46,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 975 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:13:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 01:13:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 01:13:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 01:13:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 01:13:46,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 487 [2019-11-07 01:13:46,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:46,326 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 01:13:46,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:13:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 01:13:46,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 01:13:46,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:46,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 01:13:47,512 WARN L191 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 417 DAG size of output: 99 [2019-11-07 01:13:47,644 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-11-07 01:13:48,431 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-11-07 01:13:49,038 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-11-07 01:13:49,112 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 01:13:49,113 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 01:13:49,113 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-11-07 01:13:49,113 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2019-11-07 01:13:49,113 INFO L446 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2019-11-07 01:13:49,113 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2019-11-07 01:13:49,113 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2019-11-07 01:13:49,114 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2019-11-07 01:13:49,114 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-11-07 01:13:49,114 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2019-11-07 01:13:49,114 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-11-07 01:13:49,114 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-11-07 01:13:49,114 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2019-11-07 01:13:49,115 INFO L443 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2019-11-07 01:13:49,115 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-11-07 01:13:49,115 INFO L443 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2019-11-07 01:13:49,115 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2019-11-07 01:13:49,115 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2019-11-07 01:13:49,115 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2019-11-07 01:13:49,115 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (let ((.cse0 (< 4400 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1))) [2019-11-07 01:13:49,115 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-11-07 01:13:49,116 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-07 01:13:49,116 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2019-11-07 01:13:49,116 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2019-11-07 01:13:49,116 INFO L443 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2019-11-07 01:13:49,116 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-11-07 01:13:49,116 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2019-11-07 01:13:49,116 INFO L439 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-11-07 01:13:49,116 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2019-11-07 01:13:49,117 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2019-11-07 01:13:49,117 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2019-11-07 01:13:49,117 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-11-07 01:13:49,117 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2019-11-07 01:13:49,117 INFO L443 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2019-11-07 01:13:49,117 INFO L446 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2019-11-07 01:13:49,117 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2019-11-07 01:13:49,117 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2019-11-07 01:13:49,118 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2019-11-07 01:13:49,118 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-11-07 01:13:49,118 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2019-11-07 01:13:49,118 INFO L443 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2019-11-07 01:13:49,118 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2019-11-07 01:13:49,118 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2019-11-07 01:13:49,118 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2019-11-07 01:13:49,119 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-11-07 01:13:49,119 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2019-11-07 01:13:49,119 INFO L443 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2019-11-07 01:13:49,119 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2019-11-07 01:13:49,119 INFO L443 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2019-11-07 01:13:49,119 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2019-11-07 01:13:49,119 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2))) [2019-11-07 01:13:49,119 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2019-11-07 01:13:49,120 INFO L443 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2019-11-07 01:13:49,120 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2019-11-07 01:13:49,120 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2019-11-07 01:13:49,120 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2019-11-07 01:13:49,120 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2019-11-07 01:13:49,120 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2019-11-07 01:13:49,120 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2019-11-07 01:13:49,120 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-11-07 01:13:49,121 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2019-11-07 01:13:49,121 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2019-11-07 01:13:49,121 INFO L443 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2019-11-07 01:13:49,121 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1))) [2019-11-07 01:13:49,121 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-11-07 01:13:49,121 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2019-11-07 01:13:49,121 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2019-11-07 01:13:49,121 INFO L443 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2019-11-07 01:13:49,121 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2019-11-07 01:13:49,122 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2019-11-07 01:13:49,122 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2019-11-07 01:13:49,122 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2019-11-07 01:13:49,122 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2))) [2019-11-07 01:13:49,122 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0)) (< ssl3_connect_~s__state~0 4400))) [2019-11-07 01:13:49,122 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2019-11-07 01:13:49,122 INFO L443 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2019-11-07 01:13:49,122 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2019-11-07 01:13:49,123 INFO L439 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse7 (= ssl3_connect_~s__state~0 4496)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse4 (<= ssl3_connect_~s__state~0 4352)) (.cse5 (<= 4352 ssl3_connect_~s__state~0)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse11 (= 4448 ssl3_connect_~s__state~0)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse3 (<= ssl3_connect_~blastFlag~0 2)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (= ssl3_connect_~s__state~0 4512)) (.cse13 (<= ssl3_connect_~s__state~0 3)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse15 (= 4464 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~blastFlag~0 4)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse4 .cse5) (and .cse3 (= 4384 ssl3_connect_~s__state~0)) (and .cse3 .cse0) (and .cse6 .cse7 .cse2) (and .cse6 .cse8 .cse2 .cse9 .cse10) (and (= ssl3_connect_~s__state~0 4432) .cse1 .cse2) (and .cse7 .cse1 .cse2) (and .cse1 .cse2 .cse11) (and .cse1 .cse2 .cse12) (and .cse13 .cse3 .cse2) (and .cse6 .cse14 .cse2) (and .cse6 .cse2 .cse12) (and .cse6 .cse15 .cse2) (and .cse6 .cse4 .cse5 .cse2 .cse10) (and .cse3 (= 4400 ssl3_connect_~s__state~0) .cse2) (and .cse14 .cse1 .cse2) (and .cse6 .cse2 .cse11) (and .cse3 .cse14) (and .cse3 .cse8 .cse9) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse6 .cse0 .cse2) (and .cse1 .cse2 (= 4416 ssl3_connect_~s__state~0)) (and .cse13 .cse6) (<= ssl3_connect_~blastFlag~0 0) (and .cse15 .cse1 .cse2))) [2019-11-07 01:13:49,123 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2019-11-07 01:13:49,123 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2019-11-07 01:13:49,123 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2019-11-07 01:13:49,123 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2019-11-07 01:13:49,123 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2019-11-07 01:13:49,123 INFO L439 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-11-07 01:13:49,124 INFO L443 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2019-11-07 01:13:49,124 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2019-11-07 01:13:49,124 INFO L443 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2019-11-07 01:13:49,124 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2019-11-07 01:13:49,124 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-11-07 01:13:49,124 INFO L443 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2019-11-07 01:13:49,124 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2019-11-07 01:13:49,124 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2019-11-07 01:13:49,125 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-11-07 01:13:49,125 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-11-07 01:13:49,125 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-11-07 01:13:49,125 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2019-11-07 01:13:49,125 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2019-11-07 01:13:49,125 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2019-11-07 01:13:49,125 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-11-07 01:13:49,125 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2019-11-07 01:13:49,126 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-11-07 01:13:49,126 INFO L443 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2019-11-07 01:13:49,126 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-11-07 01:13:49,126 INFO L439 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (= ssl3_connect_~s__hit~0 0) .cse1 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 0) (< ssl3_connect_~s__state~0 12292) .cse0))) [2019-11-07 01:13:49,126 INFO L439 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) (< ssl3_connect_~s__state~0 4400) (< 4368 ssl3_connect_~s__state~0))) [2019-11-07 01:13:49,126 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2019-11-07 01:13:49,126 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2019-11-07 01:13:49,127 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2019-11-07 01:13:49,127 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2019-11-07 01:13:49,127 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2019-11-07 01:13:49,127 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2019-11-07 01:13:49,127 INFO L443 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2019-11-07 01:13:49,127 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2019-11-07 01:13:49,127 INFO L439 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1))) [2019-11-07 01:13:49,128 INFO L439 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2019-11-07 01:13:49,128 INFO L443 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2019-11-07 01:13:49,128 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2019-11-07 01:13:49,128 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2019-11-07 01:13:49,128 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2019-11-07 01:13:49,128 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2019-11-07 01:13:49,128 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2019-11-07 01:13:49,128 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2019-11-07 01:13:49,128 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (< 4368 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) (= ssl3_connect_~s__hit~0 0) .cse0 .cse1))) [2019-11-07 01:13:49,129 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-07 01:13:49,132 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-11-07 01:13:49,132 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-11-07 01:13:49,132 INFO L443 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2019-11-07 01:13:49,132 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 01:13:49,132 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 01:13:49,133 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 01:13:49,133 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 01:13:49,133 INFO L439 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2019-11-07 01:13:49,133 INFO L443 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2019-11-07 01:13:49,133 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2019-11-07 01:13:49,133 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2019-11-07 01:13:49,133 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2019-11-07 01:13:49,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:13:49 BoogieIcfgContainer [2019-11-07 01:13:49,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 01:13:49,167 INFO L168 Benchmark]: Toolchain (without parser) took 24700.08 ms. Allocated memory was 145.2 MB in the beginning and 1.1 GB in the end (delta: 986.7 MB). Free memory was 101.0 MB in the beginning and 206.6 MB in the end (delta: -105.5 MB). Peak memory consumption was 881.2 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:49,167 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 01:13:49,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.67 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 177.0 MB in the end (delta: -76.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:49,169 INFO L168 Benchmark]: Boogie Preprocessor took 85.64 ms. Allocated memory is still 202.4 MB. Free memory was 177.0 MB in the beginning and 175.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:49,170 INFO L168 Benchmark]: RCFGBuilder took 776.73 ms. Allocated memory is still 202.4 MB. Free memory was 175.0 MB in the beginning and 128.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:49,170 INFO L168 Benchmark]: TraceAbstraction took 23138.60 ms. Allocated memory was 202.4 MB in the beginning and 1.1 GB in the end (delta: 929.6 MB). Free memory was 128.8 MB in the beginning and 206.6 MB in the end (delta: -77.8 MB). Peak memory consumption was 851.8 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:49,174 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.21 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 685.67 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 177.0 MB in the end (delta: -76.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 85.64 ms. Allocated memory is still 202.4 MB. Free memory was 177.0 MB in the beginning and 175.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 776.73 ms. Allocated memory is still 202.4 MB. Free memory was 175.0 MB in the beginning and 128.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23138.60 ms. Allocated memory was 202.4 MB in the beginning and 1.1 GB in the end (delta: 929.6 MB). Free memory was 128.8 MB in the beginning and 206.6 MB in the end (delta: -77.8 MB). Peak memory consumption was 851.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: 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 - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) || !(12292 <= \old(initial_state))) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 0 && s__state < 12292) && 4560 <= s__state) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4400 < s__state) && s__state <= 4560)) || (((4400 < s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state < 4400) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((s__state == 4512 && blastFlag <= 4) && s__hit == 0) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 4448 == s__state)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state)) || (blastFlag <= 2 && s__state == 4528)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || !(12292 <= \old(initial_state))) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 4416 == s__state)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || blastFlag <= 0) || ((4464 == s__state && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((blastFlag <= 0 && s__state <= 4560) && 4368 < s__state)) || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4368 < s__state) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && s__state < 4400) && 4368 < s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 136 locations, 1 error locations. Result: SAFE, OverallTime: 23.0s, OverallIterations: 26, TraceHistogramMax: 18, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, HoareTripleCheckerStatistics: 5231 SDtfs, 2285 SDslu, 3745 SDs, 0 SdLazy, 3327 SolverSat, 605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3848 GetRequests, 3796 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8460occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 6351 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 261 NumberOfFragments, 732 HoareAnnotationTreeSize, 26 FomulaSimplifications, 27594 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2775 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 7625 NumberOfCodeBlocks, 7357 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 9468 ConstructedInterpolants, 0 QuantifiedInterpolants, 3839488 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3146 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 36 InterpolantComputations, 25 PerfectInterpolantSequences, 35016/35134 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...