/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 -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:22:24,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:22:24,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:22:24,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:22:24,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:22:24,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:22:24,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:22:24,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:22:24,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:22:24,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:22:24,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:22:24,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:22:24,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:22:24,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:22:24,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:22:24,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:22:24,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:22:24,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:22:24,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:22:24,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:22:24,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:22:24,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:22:24,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:22:24,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:22:24,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:22:24,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:22:24,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:22:24,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:22:24,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:22:24,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:22:24,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:22:24,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:22:24,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:22:24,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:22:24,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:22:24,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:22:24,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:22:24,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:22:24,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:22:24,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:22:24,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:22:24,901 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-06 22:22:24,929 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:22:24,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:22:24,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:22:24,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:22:24,932 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:22:24,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:22:24,932 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:22:24,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:22:24,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:22:24,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:22:24,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:22:24,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:22:24,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:22:24,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:22:24,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:22:24,935 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:22:24,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:22:24,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:22:24,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:22:24,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:22:24,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:22:24,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:22:24,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:22:24,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:22:24,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:22:24,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:22:24,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:22:24,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:22:24,938 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:22:25,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:22:25,223 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:22:25,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:22:25,228 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:22:25,229 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:22:25,229 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-06 22:22:25,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aea0cdabe/32d482ed82584e13939780f652ce5bc5/FLAG0800409bf [2019-11-06 22:22:25,836 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:22:25,838 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-1.c [2019-11-06 22:22:25,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aea0cdabe/32d482ed82584e13939780f652ce5bc5/FLAG0800409bf [2019-11-06 22:22:26,158 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aea0cdabe/32d482ed82584e13939780f652ce5bc5 [2019-11-06 22:22:26,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:22:26,169 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:22:26,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:22:26,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:22:26,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:22:26,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c31f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26, skipping insertion in model container [2019-11-06 22:22:26,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,184 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:22:26,224 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:22:26,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:22:26,446 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:22:26,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:22:26,618 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:22:26,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26 WrapperNode [2019-11-06 22:22:26,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:22:26,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:22:26,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:22:26,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:22:26,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:22:26,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:22:26,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:22:26,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:22:26,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (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-06 22:22:26,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:22:26,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:22:26,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-11-06 22:22:26,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:22:26,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:22:26,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:22:26,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:22:26,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-06 22:22:26,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-06 22:22:26,753 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-11-06 22:22:26,753 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:22:26,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:22:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:22:26,897 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 22:22:27,484 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-06 22:22:27,485 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-06 22:22:27,502 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:22:27,503 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:22:27,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:27 BoogieIcfgContainer [2019-11-06 22:22:27,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:22:27,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:22:27,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:22:27,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:22:27,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:22:26" (1/3) ... [2019-11-06 22:22:27,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3c11b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:27, skipping insertion in model container [2019-11-06 22:22:27,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (2/3) ... [2019-11-06 22:22:27,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3c11b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:27, skipping insertion in model container [2019-11-06 22:22:27,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:27" (3/3) ... [2019-11-06 22:22:27,515 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2019-11-06 22:22:27,524 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:22:27,533 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:22:27,544 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:22:27,570 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:22:27,570 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:22:27,572 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:22:27,572 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:22:27,572 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:22:27,572 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:22:27,573 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:22:27,573 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:22:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-11-06 22:22:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 22:22:27,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:27,612 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-06 22:22:27,614 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:27,619 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-11-06 22:22:27,626 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:27,626 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827663835] [2019-11-06 22:22:27,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:27,869 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-06 22:22:27,869 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827663835] [2019-11-06 22:22:27,871 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:27,871 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:27,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182210] [2019-11-06 22:22:27,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:27,878 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:27,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:27,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:27,896 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-11-06 22:22:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:28,068 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-11-06 22:22:28,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:28,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-06 22:22:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:28,099 INFO L225 Difference]: With dead ends: 377 [2019-11-06 22:22:28,100 INFO L226 Difference]: Without dead ends: 220 [2019-11-06 22:22:28,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:28,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-06 22:22:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-11-06 22:22:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-06 22:22:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-11-06 22:22:28,203 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-11-06 22:22:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:28,204 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-11-06 22:22:28,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-11-06 22:22:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 22:22:28,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:28,209 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-06 22:22:28,209 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:28,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2019-11-06 22:22:28,210 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:28,210 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429332713] [2019-11-06 22:22:28,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:28,329 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-06 22:22:28,330 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429332713] [2019-11-06 22:22:28,330 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:28,330 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:28,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549083718] [2019-11-06 22:22:28,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:28,333 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:28,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:28,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:28,334 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-11-06 22:22:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:28,529 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2019-11-06 22:22:28,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:28,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-06 22:22:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:28,533 INFO L225 Difference]: With dead ends: 470 [2019-11-06 22:22:28,533 INFO L226 Difference]: Without dead ends: 262 [2019-11-06 22:22:28,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:28,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-06 22:22:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2019-11-06 22:22:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-06 22:22:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-11-06 22:22:28,556 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-11-06 22:22:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:28,556 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-11-06 22:22:28,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:28,557 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-11-06 22:22:28,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 22:22:28,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:28,560 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-06 22:22:28,560 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:28,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:28,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1578262845, now seen corresponding path program 1 times [2019-11-06 22:22:28,561 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:28,561 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515270960] [2019-11-06 22:22:28,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:28,693 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-06 22:22:28,693 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515270960] [2019-11-06 22:22:28,694 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:28,694 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:28,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933781081] [2019-11-06 22:22:28,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:28,695 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:28,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:28,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:28,696 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-11-06 22:22:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:28,928 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-11-06 22:22:28,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:28,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-06 22:22:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:28,932 INFO L225 Difference]: With dead ends: 598 [2019-11-06 22:22:28,932 INFO L226 Difference]: Without dead ends: 354 [2019-11-06 22:22:28,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-06 22:22:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-11-06 22:22:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-06 22:22:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-11-06 22:22:28,954 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-11-06 22:22:28,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:28,955 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-11-06 22:22:28,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:28,955 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-11-06 22:22:28,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 22:22:28,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:28,959 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-06 22:22:28,959 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:28,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:28,960 INFO L82 PathProgramCache]: Analyzing trace with hash -227175489, now seen corresponding path program 1 times [2019-11-06 22:22:28,960 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:28,960 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030649652] [2019-11-06 22:22:28,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,063 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-06 22:22:29,064 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030649652] [2019-11-06 22:22:29,064 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:29,064 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:29,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328133389] [2019-11-06 22:22:29,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:29,065 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:29,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:29,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:29,066 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-11-06 22:22:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:29,236 INFO L93 Difference]: Finished difference Result 710 states and 1008 transitions. [2019-11-06 22:22:29,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:29,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-06 22:22:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:29,240 INFO L225 Difference]: With dead ends: 710 [2019-11-06 22:22:29,240 INFO L226 Difference]: Without dead ends: 386 [2019-11-06 22:22:29,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-06 22:22:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 374. [2019-11-06 22:22:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-06 22:22:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-11-06 22:22:29,262 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-11-06 22:22:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:29,263 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-11-06 22:22:29,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-11-06 22:22:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-06 22:22:29,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:29,268 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-06 22:22:29,269 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:29,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:29,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1103228957, now seen corresponding path program 1 times [2019-11-06 22:22:29,270 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:29,270 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173833332] [2019-11-06 22:22:29,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,369 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-06 22:22:29,370 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173833332] [2019-11-06 22:22:29,371 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:29,372 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:29,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938856526] [2019-11-06 22:22:29,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:29,374 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:29,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:29,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:29,375 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-11-06 22:22:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:29,574 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-11-06 22:22:29,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:29,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-06 22:22:29,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:29,579 INFO L225 Difference]: With dead ends: 842 [2019-11-06 22:22:29,579 INFO L226 Difference]: Without dead ends: 478 [2019-11-06 22:22:29,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-06 22:22:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-11-06 22:22:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-06 22:22:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-11-06 22:22:29,598 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-11-06 22:22:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:29,599 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-11-06 22:22:29,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-11-06 22:22:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-06 22:22:29,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:29,602 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-06 22:22:29,603 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:29,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:29,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1629529054, now seen corresponding path program 1 times [2019-11-06 22:22:29,603 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:29,604 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518344562] [2019-11-06 22:22:29,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,680 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-06 22:22:29,680 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518344562] [2019-11-06 22:22:29,681 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:29,681 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:29,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915979471] [2019-11-06 22:22:29,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:29,682 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:29,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:29,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:29,683 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-11-06 22:22:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:29,829 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-11-06 22:22:29,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:29,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-06 22:22:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:29,833 INFO L225 Difference]: With dead ends: 940 [2019-11-06 22:22:29,834 INFO L226 Difference]: Without dead ends: 500 [2019-11-06 22:22:29,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:29,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-06 22:22:29,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-11-06 22:22:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-06 22:22:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-11-06 22:22:29,852 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-11-06 22:22:29,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:29,852 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-11-06 22:22:29,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:29,853 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-11-06 22:22:29,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-06 22:22:29,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:29,855 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-06 22:22:29,855 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:29,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:29,855 INFO L82 PathProgramCache]: Analyzing trace with hash -233915046, now seen corresponding path program 1 times [2019-11-06 22:22:29,856 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:29,856 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846334483] [2019-11-06 22:22:29,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,927 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-06 22:22:29,927 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846334483] [2019-11-06 22:22:29,928 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:29,928 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:29,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104111501] [2019-11-06 22:22:29,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:29,929 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:29,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:29,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:29,930 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-11-06 22:22:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:29,981 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-11-06 22:22:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:29,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-06 22:22:29,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:29,986 INFO L225 Difference]: With dead ends: 976 [2019-11-06 22:22:29,986 INFO L226 Difference]: Without dead ends: 734 [2019-11-06 22:22:29,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-11-06 22:22:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-11-06 22:22:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-11-06 22:22:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-11-06 22:22:30,026 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-11-06 22:22:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:30,027 INFO L462 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-11-06 22:22:30,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-11-06 22:22:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-06 22:22:30,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:30,030 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-06 22:22:30,030 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:30,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:30,030 INFO L82 PathProgramCache]: Analyzing trace with hash -674483159, now seen corresponding path program 1 times [2019-11-06 22:22:30,031 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:30,031 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561666730] [2019-11-06 22:22:30,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,110 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-06 22:22:30,111 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561666730] [2019-11-06 22:22:30,111 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:30,111 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:30,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304803212] [2019-11-06 22:22:30,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:30,112 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:30,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:30,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:30,113 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-11-06 22:22:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:30,160 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-11-06 22:22:30,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:30,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-06 22:22:30,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:30,167 INFO L225 Difference]: With dead ends: 976 [2019-11-06 22:22:30,167 INFO L226 Difference]: Without dead ends: 974 [2019-11-06 22:22:30,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:30,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-11-06 22:22:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-11-06 22:22:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-11-06 22:22:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-11-06 22:22:30,198 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-11-06 22:22:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:30,199 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-11-06 22:22:30,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-11-06 22:22:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-06 22:22:30,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:30,206 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-06 22:22:30,206 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:30,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:30,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2095197958, now seen corresponding path program 1 times [2019-11-06 22:22:30,206 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:30,207 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134634698] [2019-11-06 22:22:30,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,263 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-06 22:22:30,263 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134634698] [2019-11-06 22:22:30,263 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:30,264 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:30,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319279287] [2019-11-06 22:22:30,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:30,265 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:30,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:30,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:30,265 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-11-06 22:22:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:30,438 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-11-06 22:22:30,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:30,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-06 22:22:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:30,445 INFO L225 Difference]: With dead ends: 2140 [2019-11-06 22:22:30,445 INFO L226 Difference]: Without dead ends: 1170 [2019-11-06 22:22:30,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-11-06 22:22:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-11-06 22:22:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-11-06 22:22:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-11-06 22:22:30,498 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 139 [2019-11-06 22:22:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:30,499 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-11-06 22:22:30,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-11-06 22:22:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-06 22:22:30,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:30,503 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-06 22:22:30,503 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:30,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:30,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2111242741, now seen corresponding path program 1 times [2019-11-06 22:22:30,503 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:30,504 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254801511] [2019-11-06 22:22:30,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,571 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-06 22:22:30,571 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254801511] [2019-11-06 22:22:30,571 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:30,572 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:30,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563933709] [2019-11-06 22:22:30,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:30,573 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:30,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:30,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:30,573 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-11-06 22:22:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:30,711 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-11-06 22:22:30,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:30,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-06 22:22:30,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:30,718 INFO L225 Difference]: With dead ends: 2354 [2019-11-06 22:22:30,718 INFO L226 Difference]: Without dead ends: 1236 [2019-11-06 22:22:30,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-11-06 22:22:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-11-06 22:22:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-11-06 22:22:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-11-06 22:22:30,756 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 175 [2019-11-06 22:22:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:30,757 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-11-06 22:22:30,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-11-06 22:22:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-06 22:22:30,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:30,761 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-06 22:22:30,761 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:30,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:30,762 INFO L82 PathProgramCache]: Analyzing trace with hash 834252520, now seen corresponding path program 1 times [2019-11-06 22:22:30,762 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:30,762 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173695416] [2019-11-06 22:22:30,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,848 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-06 22:22:30,849 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173695416] [2019-11-06 22:22:30,849 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:30,849 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:30,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941953228] [2019-11-06 22:22:30,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:30,851 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:30,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:30,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:30,852 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-11-06 22:22:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:31,036 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-11-06 22:22:31,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:31,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-11-06 22:22:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:31,044 INFO L225 Difference]: With dead ends: 2544 [2019-11-06 22:22:31,044 INFO L226 Difference]: Without dead ends: 1334 [2019-11-06 22:22:31,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-11-06 22:22:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-11-06 22:22:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-11-06 22:22:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-11-06 22:22:31,084 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 196 [2019-11-06 22:22:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:31,085 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-11-06 22:22:31,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-11-06 22:22:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-06 22:22:31,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:31,090 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-06 22:22:31,090 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:31,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1654542421, now seen corresponding path program 1 times [2019-11-06 22:22:31,091 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:31,091 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767516016] [2019-11-06 22:22:31,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:31,196 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-06 22:22:31,196 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767516016] [2019-11-06 22:22:31,197 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:31,197 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:31,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361692021] [2019-11-06 22:22:31,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:31,198 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:31,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:31,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:31,199 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2019-11-06 22:22:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:31,361 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-11-06 22:22:31,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:31,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-11-06 22:22:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:31,370 INFO L225 Difference]: With dead ends: 2752 [2019-11-06 22:22:31,370 INFO L226 Difference]: Without dead ends: 1442 [2019-11-06 22:22:31,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-11-06 22:22:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-11-06 22:22:31,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-11-06 22:22:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-11-06 22:22:31,412 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 220 [2019-11-06 22:22:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:31,412 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-11-06 22:22:31,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-11-06 22:22:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-06 22:22:31,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:31,417 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-06 22:22:31,418 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:31,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1609383977, now seen corresponding path program 1 times [2019-11-06 22:22:31,419 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:31,419 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214134376] [2019-11-06 22:22:31,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:31,538 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-06 22:22:31,538 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214134376] [2019-11-06 22:22:31,539 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:31,539 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:31,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448769329] [2019-11-06 22:22:31,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:31,540 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:31,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:31,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:31,541 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-11-06 22:22:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:31,699 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-11-06 22:22:31,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:31,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-11-06 22:22:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:31,707 INFO L225 Difference]: With dead ends: 2992 [2019-11-06 22:22:31,707 INFO L226 Difference]: Without dead ends: 1570 [2019-11-06 22:22:31,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:31,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-11-06 22:22:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-11-06 22:22:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-11-06 22:22:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-11-06 22:22:31,756 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 220 [2019-11-06 22:22:31,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:31,756 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-11-06 22:22:31,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-11-06 22:22:31,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-06 22:22:31,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:31,762 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-06 22:22:31,762 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:31,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:31,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1500640469, now seen corresponding path program 1 times [2019-11-06 22:22:31,763 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:31,763 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429085047] [2019-11-06 22:22:31,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:31,894 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-06 22:22:31,895 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429085047] [2019-11-06 22:22:31,895 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:31,895 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:31,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110367968] [2019-11-06 22:22:31,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:31,896 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:31,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:31,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:31,897 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-11-06 22:22:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:31,974 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-11-06 22:22:31,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:31,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-11-06 22:22:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:31,996 INFO L225 Difference]: With dead ends: 4646 [2019-11-06 22:22:31,996 INFO L226 Difference]: Without dead ends: 3100 [2019-11-06 22:22:32,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:32,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-11-06 22:22:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-11-06 22:22:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-11-06 22:22:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-11-06 22:22:32,108 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 250 [2019-11-06 22:22:32,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:32,109 INFO L462 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-11-06 22:22:32,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:32,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-11-06 22:22:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-06 22:22:32,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:32,124 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-06 22:22:32,124 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:32,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:32,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1763285929, now seen corresponding path program 1 times [2019-11-06 22:22:32,125 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:32,125 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432978290] [2019-11-06 22:22:32,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:32,284 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-06 22:22:32,285 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432978290] [2019-11-06 22:22:32,285 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:32,285 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:32,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914671478] [2019-11-06 22:22:32,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:32,287 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:32,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:32,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:32,288 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-11-06 22:22:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:32,552 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-11-06 22:22:32,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:32,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-11-06 22:22:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:32,577 INFO L225 Difference]: With dead ends: 6484 [2019-11-06 22:22:32,577 INFO L226 Difference]: Without dead ends: 3398 [2019-11-06 22:22:32,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-11-06 22:22:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-11-06 22:22:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-11-06 22:22:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-11-06 22:22:32,725 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 250 [2019-11-06 22:22:32,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:32,726 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-11-06 22:22:32,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:32,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-11-06 22:22:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-06 22:22:32,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:32,735 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-06 22:22:32,735 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:32,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1165577599, now seen corresponding path program 1 times [2019-11-06 22:22:32,736 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:32,736 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154471031] [2019-11-06 22:22:32,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:32,841 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-06 22:22:32,844 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154471031] [2019-11-06 22:22:32,848 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:32,849 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:32,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097458350] [2019-11-06 22:22:32,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:32,850 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:32,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:32,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:32,850 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-11-06 22:22:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:33,025 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-11-06 22:22:33,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:33,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-11-06 22:22:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:33,041 INFO L225 Difference]: With dead ends: 6900 [2019-11-06 22:22:33,042 INFO L226 Difference]: Without dead ends: 3530 [2019-11-06 22:22:33,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-11-06 22:22:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-11-06 22:22:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-11-06 22:22:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-11-06 22:22:33,132 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 274 [2019-11-06 22:22:33,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:33,133 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-11-06 22:22:33,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-11-06 22:22:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-11-06 22:22:33,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:33,142 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-06 22:22:33,143 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:33,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:33,143 INFO L82 PathProgramCache]: Analyzing trace with hash -373875199, now seen corresponding path program 1 times [2019-11-06 22:22:33,144 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:33,144 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474247679] [2019-11-06 22:22:33,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:33,357 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-06 22:22:33,357 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474247679] [2019-11-06 22:22:33,357 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:33,358 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:33,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265230007] [2019-11-06 22:22:33,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:33,359 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:33,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:33,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:33,359 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-11-06 22:22:33,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:33,631 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-11-06 22:22:33,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:33,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2019-11-06 22:22:33,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:33,656 INFO L225 Difference]: With dead ends: 7416 [2019-11-06 22:22:33,656 INFO L226 Difference]: Without dead ends: 3914 [2019-11-06 22:22:33,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:33,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-11-06 22:22:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-11-06 22:22:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-11-06 22:22:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-11-06 22:22:33,798 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 285 [2019-11-06 22:22:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:33,798 INFO L462 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-11-06 22:22:33,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-11-06 22:22:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-11-06 22:22:33,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:33,812 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-06 22:22:33,812 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:33,814 INFO L82 PathProgramCache]: Analyzing trace with hash -233584477, now seen corresponding path program 1 times [2019-11-06 22:22:33,815 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:33,815 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900064935] [2019-11-06 22:22:33,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:33,984 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-06 22:22:33,984 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900064935] [2019-11-06 22:22:33,985 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:33,985 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:33,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798121159] [2019-11-06 22:22:33,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:33,986 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:33,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:33,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:33,986 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-11-06 22:22:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:34,188 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-11-06 22:22:34,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:34,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-11-06 22:22:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:34,220 INFO L225 Difference]: With dead ends: 8048 [2019-11-06 22:22:34,220 INFO L226 Difference]: Without dead ends: 4234 [2019-11-06 22:22:34,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-11-06 22:22:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-11-06 22:22:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-11-06 22:22:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-11-06 22:22:34,331 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 299 [2019-11-06 22:22:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:34,332 INFO L462 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-11-06 22:22:34,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-11-06 22:22:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-06 22:22:34,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:34,342 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-06 22:22:34,342 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:34,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:34,343 INFO L82 PathProgramCache]: Analyzing trace with hash -110745964, now seen corresponding path program 1 times [2019-11-06 22:22:34,343 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:34,343 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860004550] [2019-11-06 22:22:34,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:34,485 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-06 22:22:34,486 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860004550] [2019-11-06 22:22:34,486 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:34,486 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:34,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739261929] [2019-11-06 22:22:34,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:34,488 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:34,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:34,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:34,488 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-11-06 22:22:34,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:34,600 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-11-06 22:22:34,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:34,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-06 22:22:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:34,629 INFO L225 Difference]: With dead ends: 11310 [2019-11-06 22:22:34,630 INFO L226 Difference]: Without dead ends: 7376 [2019-11-06 22:22:34,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-11-06 22:22:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-11-06 22:22:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-11-06 22:22:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-11-06 22:22:34,940 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 300 [2019-11-06 22:22:34,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:34,940 INFO L462 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-11-06 22:22:34,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-11-06 22:22:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-11-06 22:22:34,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:34,962 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-06 22:22:34,962 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:34,963 INFO L82 PathProgramCache]: Analyzing trace with hash 123119806, now seen corresponding path program 1 times [2019-11-06 22:22:34,963 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:34,963 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474898759] [2019-11-06 22:22:34,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:35,149 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-06 22:22:35,149 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474898759] [2019-11-06 22:22:35,149 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:35,150 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:35,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935068031] [2019-11-06 22:22:35,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:35,151 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:35,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:35,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:35,151 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-11-06 22:22:35,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:35,378 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-11-06 22:22:35,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:35,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-11-06 22:22:35,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:35,394 INFO L225 Difference]: With dead ends: 14744 [2019-11-06 22:22:35,395 INFO L226 Difference]: Without dead ends: 7382 [2019-11-06 22:22:35,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:35,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-11-06 22:22:35,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-11-06 22:22:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-11-06 22:22:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-11-06 22:22:35,564 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 301 [2019-11-06 22:22:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:35,565 INFO L462 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-11-06 22:22:35,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-11-06 22:22:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-06 22:22:35,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:35,581 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-06 22:22:35,582 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:35,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash -994522767, now seen corresponding path program 1 times [2019-11-06 22:22:35,582 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:35,582 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236019376] [2019-11-06 22:22:35,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:35,790 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-06 22:22:35,790 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236019376] [2019-11-06 22:22:35,791 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784984453] [2019-11-06 22:22:35,791 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-06 22:22:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:35,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 22:22:36,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:36,208 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-06 22:22:36,208 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:22:36,209 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-11-06 22:22:36,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026878320] [2019-11-06 22:22:36,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:36,211 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:36,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:36,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:22:36,212 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 5 states. [2019-11-06 22:22:36,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:36,692 INFO L93 Difference]: Finished difference Result 14866 states and 19371 transitions. [2019-11-06 22:22:36,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:36,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 324 [2019-11-06 22:22:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:36,717 INFO L225 Difference]: With dead ends: 14866 [2019-11-06 22:22:36,718 INFO L226 Difference]: Without dead ends: 7500 [2019-11-06 22:22:36,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:22:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7500 states. [2019-11-06 22:22:37,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7500 to 7356. [2019-11-06 22:22:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2019-11-06 22:22:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2019-11-06 22:22:37,101 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 324 [2019-11-06 22:22:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:37,101 INFO L462 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2019-11-06 22:22:37,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2019-11-06 22:22:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-11-06 22:22:37,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:37,118 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-06 22:22:37,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:37,332 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:37,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:37,333 INFO L82 PathProgramCache]: Analyzing trace with hash -697717157, now seen corresponding path program 1 times [2019-11-06 22:22:37,333 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:37,333 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708415966] [2019-11-06 22:22:37,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:37,549 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-06 22:22:37,550 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708415966] [2019-11-06 22:22:37,550 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778917777] [2019-11-06 22:22:37,550 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-06 22:22:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:37,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:37,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:37,834 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-06 22:22:37,835 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:22:37,835 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:22:37,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110812349] [2019-11-06 22:22:37,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:22:37,837 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:37,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:22:37,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:22:37,838 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 4 states. [2019-11-06 22:22:38,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:38,350 INFO L93 Difference]: Finished difference Result 14624 states and 19043 transitions. [2019-11-06 22:22:38,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:38,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 337 [2019-11-06 22:22:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:38,373 INFO L225 Difference]: With dead ends: 14624 [2019-11-06 22:22:38,373 INFO L226 Difference]: Without dead ends: 11034 [2019-11-06 22:22:38,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:38,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2019-11-06 22:22:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2019-11-06 22:22:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-11-06 22:22:38,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-11-06 22:22:38,598 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 337 [2019-11-06 22:22:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:38,599 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-11-06 22:22:38,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:22:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-11-06 22:22:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-11-06 22:22:38,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:38,616 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-06 22:22:38,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:38,822 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:38,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:38,822 INFO L82 PathProgramCache]: Analyzing trace with hash 233855425, now seen corresponding path program 2 times [2019-11-06 22:22:38,823 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:38,824 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201058685] [2019-11-06 22:22:38,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:39,016 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-06 22:22:39,016 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201058685] [2019-11-06 22:22:39,017 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24341803] [2019-11-06 22:22:39,017 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-06 22:22:39,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 22:22:39,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 22:22:39,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:39,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2019-11-06 22:22:39,350 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:22:39,350 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-06 22:22:39,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157149631] [2019-11-06 22:22:39,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:39,352 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:39,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:39,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:39,352 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 3 states. [2019-11-06 22:22:39,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:39,635 INFO L93 Difference]: Finished difference Result 16374 states and 21042 transitions. [2019-11-06 22:22:39,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:39,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2019-11-06 22:22:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:39,661 INFO L225 Difference]: With dead ends: 16374 [2019-11-06 22:22:39,661 INFO L226 Difference]: Without dead ends: 7932 [2019-11-06 22:22:39,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2019-11-06 22:22:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7684. [2019-11-06 22:22:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2019-11-06 22:22:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 9645 transitions. [2019-11-06 22:22:39,937 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 9645 transitions. Word has length 350 [2019-11-06 22:22:39,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:39,938 INFO L462 AbstractCegarLoop]: Abstraction has 7684 states and 9645 transitions. [2019-11-06 22:22:39,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 9645 transitions. [2019-11-06 22:22:39,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-11-06 22:22:39,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:39,963 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-06 22:22:40,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:40,170 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:40,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:40,171 INFO L82 PathProgramCache]: Analyzing trace with hash -382228618, now seen corresponding path program 1 times [2019-11-06 22:22:40,171 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:40,171 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233156212] [2019-11-06 22:22:40,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:40,441 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-06 22:22:40,441 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233156212] [2019-11-06 22:22:40,442 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459602366] [2019-11-06 22:22:40,442 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-06 22:22:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:40,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:40,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:40,885 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-06 22:22:40,886 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:22:40,886 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:22:40,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937132890] [2019-11-06 22:22:40,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:22:40,890 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:40,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:22:40,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:22:40,890 INFO L87 Difference]: Start difference. First operand 7684 states and 9645 transitions. Second operand 4 states. [2019-11-06 22:22:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:41,311 INFO L93 Difference]: Finished difference Result 17150 states and 21439 transitions. [2019-11-06 22:22:41,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:22:41,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2019-11-06 22:22:41,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:41,329 INFO L225 Difference]: With dead ends: 17150 [2019-11-06 22:22:41,329 INFO L226 Difference]: Without dead ends: 9476 [2019-11-06 22:22:41,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:41,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9476 states. [2019-11-06 22:22:41,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9476 to 7983. [2019-11-06 22:22:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7983 states. [2019-11-06 22:22:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 9971 transitions. [2019-11-06 22:22:41,503 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 9971 transitions. Word has length 381 [2019-11-06 22:22:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:41,504 INFO L462 AbstractCegarLoop]: Abstraction has 7983 states and 9971 transitions. [2019-11-06 22:22:41,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:22:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 9971 transitions. [2019-11-06 22:22:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-06 22:22:41,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:41,521 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-06 22:22:41,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:41,726 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:41,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:41,726 INFO L82 PathProgramCache]: Analyzing trace with hash 675475598, now seen corresponding path program 1 times [2019-11-06 22:22:41,726 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:41,727 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970417309] [2019-11-06 22:22:41,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:42,001 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-06 22:22:42,001 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970417309] [2019-11-06 22:22:42,002 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:42,002 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:42,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348793080] [2019-11-06 22:22:42,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:42,004 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:42,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:42,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:42,005 INFO L87 Difference]: Start difference. First operand 7983 states and 9971 transitions. Second operand 3 states. [2019-11-06 22:22:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:42,514 INFO L93 Difference]: Finished difference Result 15357 states and 18836 transitions. [2019-11-06 22:22:42,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:42,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-11-06 22:22:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:42,528 INFO L225 Difference]: With dead ends: 15357 [2019-11-06 22:22:42,528 INFO L226 Difference]: Without dead ends: 3807 [2019-11-06 22:22:42,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 22:22:42,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2019-11-06 22:22:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 3549. [2019-11-06 22:22:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2019-11-06 22:22:42,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 4386 transitions. [2019-11-06 22:22:42,646 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 4386 transitions. Word has length 420 [2019-11-06 22:22:42,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:42,647 INFO L462 AbstractCegarLoop]: Abstraction has 3549 states and 4386 transitions. [2019-11-06 22:22:42,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4386 transitions. [2019-11-06 22:22:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-11-06 22:22:42,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:42,669 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-06 22:22:42,669 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash 331734252, now seen corresponding path program 1 times [2019-11-06 22:22:42,670 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:42,670 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836730000] [2019-11-06 22:22:42,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:43,022 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-06 22:22:43,022 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836730000] [2019-11-06 22:22:43,023 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488946030] [2019-11-06 22:22:43,024 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-06 22:22:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:43,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:43,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:43,550 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-06 22:22:43,551 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:22:43,551 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:22:43,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054741066] [2019-11-06 22:22:43,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:22:43,552 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:43,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:22:43,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:22:43,554 INFO L87 Difference]: Start difference. First operand 3549 states and 4386 transitions. Second operand 4 states. [2019-11-06 22:22:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:43,738 INFO L93 Difference]: Finished difference Result 4045 states and 5011 transitions. [2019-11-06 22:22:43,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:22:43,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 487 [2019-11-06 22:22:43,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:43,739 INFO L225 Difference]: With dead ends: 4045 [2019-11-06 22:22:43,739 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 22:22:43,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 22:22:43,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 22:22:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 22:22:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 22:22:43,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 487 [2019-11-06 22:22:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:43,745 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 22:22:43,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:22:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 22:22:43,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 22:22:43,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:43,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 22:22:44,766 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 390 DAG size of output: 98 [2019-11-06 22:22:46,121 WARN L191 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-11-06 22:22:46,154 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-06 22:22:46,154 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:22:46,154 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-11-06 22:22:46,154 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2019-11-06 22:22:46,154 INFO L446 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2019-11-06 22:22:46,154 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2019-11-06 22:22:46,155 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2019-11-06 22:22:46,155 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2019-11-06 22:22:46,155 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 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))) [2019-11-06 22:22:46,155 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-06 22:22:46,155 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-11-06 22:22:46,155 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-11-06 22:22:46,156 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2019-11-06 22:22:46,157 INFO L443 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2019-11-06 22:22:46,157 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-11-06 22:22:46,157 INFO L443 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2019-11-06 22:22:46,157 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2019-11-06 22:22:46,157 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2019-11-06 22:22:46,157 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2019-11-06 22:22:46,159 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2019-11-06 22:22:46,159 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-11-06 22:22:46,159 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-06 22:22:46,159 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2019-11-06 22:22:46,159 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2019-11-06 22:22:46,160 INFO L443 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2019-11-06 22:22:46,160 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-11-06 22:22:46,160 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2019-11-06 22:22:46,160 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-06 22:22:46,160 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2019-11-06 22:22:46,160 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2019-11-06 22:22:46,160 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2019-11-06 22:22:46,160 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 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))) [2019-11-06 22:22:46,160 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2019-11-06 22:22:46,161 INFO L443 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2019-11-06 22:22:46,163 INFO L446 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2019-11-06 22:22:46,163 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2019-11-06 22:22:46,163 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2019-11-06 22:22:46,163 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2019-11-06 22:22:46,163 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2019-11-06 22:22:46,163 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2019-11-06 22:22:46,164 INFO L443 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2019-11-06 22:22:46,165 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2019-11-06 22:22:46,165 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2019-11-06 22:22:46,165 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2019-11-06 22:22:46,165 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-11-06 22:22:46,165 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2019-11-06 22:22:46,165 INFO L443 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2019-11-06 22:22:46,165 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2019-11-06 22:22:46,165 INFO L443 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2019-11-06 22:22:46,165 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2019-11-06 22:22:46,166 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-11-06 22:22:46,166 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2019-11-06 22:22:46,166 INFO L443 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2019-11-06 22:22:46,166 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2019-11-06 22:22:46,166 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2019-11-06 22:22:46,166 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2019-11-06 22:22:46,166 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2019-11-06 22:22:46,166 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2019-11-06 22:22:46,167 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-11-06 22:22:46,167 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2019-11-06 22:22:46,167 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2019-11-06 22:22:46,167 INFO L443 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2019-11-06 22:22:46,167 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 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))) [2019-11-06 22:22:46,167 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-11-06 22:22:46,167 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2019-11-06 22:22:46,167 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2019-11-06 22:22:46,167 INFO L443 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2019-11-06 22:22:46,168 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2019-11-06 22:22:46,168 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2019-11-06 22:22:46,168 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2019-11-06 22:22:46,168 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2019-11-06 22:22:46,168 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-11-06 22:22:46,168 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-11-06 22:22:46,168 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2019-11-06 22:22:46,168 INFO L443 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2019-11-06 22:22:46,170 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2019-11-06 22:22:46,170 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2019-11-06 22:22:46,171 INFO L439 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse10 (= 4464 ssl3_connect_~s__state~0)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse15 (= 4448 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse7 .cse8) (and .cse5 .cse0 .cse1) (and .cse9 .cse6 .cse1) (and .cse3 .cse10 .cse1) (and .cse6 .cse5) (and .cse3 .cse11 .cse1) (and .cse3 .cse7 .cse1 .cse8 .cse12) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse9 .cse3) (and .cse6 (= 4384 ssl3_connect_~s__state~0)) (and .cse3 .cse1 .cse2) (and .cse10 .cse0 .cse1) (and .cse6 .cse11) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse13 .cse14) (and .cse11 .cse0 .cse1) (and .cse3 .cse1 .cse15) (and .cse6 (= 4400 ssl3_connect_~s__state~0) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse13 .cse14 .cse1 .cse12) (and .cse4 .cse0 .cse1) (and .cse0 .cse1 (= 4416 ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse15))) [2019-11-06 22:22:46,171 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2019-11-06 22:22:46,171 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2019-11-06 22:22:46,171 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2019-11-06 22:22:46,171 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2019-11-06 22:22:46,171 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2019-11-06 22:22:46,172 INFO L439 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-11-06 22:22:46,172 INFO L443 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2019-11-06 22:22:46,172 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2019-11-06 22:22:46,172 INFO L443 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2019-11-06 22:22:46,172 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2019-11-06 22:22:46,173 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-11-06 22:22:46,173 INFO L443 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2019-11-06 22:22:46,173 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2019-11-06 22:22:46,174 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2019-11-06 22:22:46,174 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-11-06 22:22:46,174 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-11-06 22:22:46,174 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-11-06 22:22:46,174 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2019-11-06 22:22:46,174 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2019-11-06 22:22:46,174 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2019-11-06 22:22:46,174 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-11-06 22:22:46,174 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2019-11-06 22:22:46,175 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-11-06 22:22:46,175 INFO L443 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2019-11-06 22:22:46,175 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-11-06 22:22:46,177 INFO L439 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 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 2) .cse0 .cse1) (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)))) [2019-11-06 22:22:46,177 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) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-11-06 22:22:46,177 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2019-11-06 22:22:46,177 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2019-11-06 22:22:46,177 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2019-11-06 22:22:46,177 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2019-11-06 22:22:46,178 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2019-11-06 22:22:46,178 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2019-11-06 22:22:46,178 INFO L443 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2019-11-06 22:22:46,178 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2019-11-06 22:22:46,178 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_~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-06 22:22:46,178 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_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-11-06 22:22:46,178 INFO L443 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2019-11-06 22:22:46,179 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2019-11-06 22:22:46,179 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2019-11-06 22:22:46,179 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2019-11-06 22:22:46,179 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2019-11-06 22:22:46,179 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2019-11-06 22:22:46,179 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2019-11-06 22:22:46,179 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2019-11-06 22:22:46,179 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-06 22:22:46,179 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-11-06 22:22:46,180 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-11-06 22:22:46,180 INFO L443 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2019-11-06 22:22:46,180 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:22:46,180 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 22:22:46,180 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 22:22:46,180 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 22:22:46,180 INFO L439 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2019-11-06 22:22:46,180 INFO L443 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2019-11-06 22:22:46,181 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2019-11-06 22:22:46,181 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2019-11-06 22:22:46,181 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2019-11-06 22:22:46,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:22:46 BoogieIcfgContainer [2019-11-06 22:22:46,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 22:22:46,231 INFO L168 Benchmark]: Toolchain (without parser) took 20061.40 ms. Allocated memory was 147.3 MB in the beginning and 901.3 MB in the end (delta: 753.9 MB). Free memory was 103.8 MB in the beginning and 213.4 MB in the end (delta: -109.6 MB). Peak memory consumption was 644.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:46,231 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 147.3 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 22:22:46,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.79 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 103.6 MB in the beginning and 179.8 MB in the end (delta: -76.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:46,232 INFO L168 Benchmark]: Boogie Preprocessor took 61.59 ms. Allocated memory is still 204.5 MB. Free memory was 179.8 MB in the beginning and 177.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:46,234 INFO L168 Benchmark]: RCFGBuilder took 823.64 ms. Allocated memory is still 204.5 MB. Free memory was 177.2 MB in the beginning and 131.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:46,235 INFO L168 Benchmark]: TraceAbstraction took 18719.73 ms. Allocated memory was 204.5 MB in the beginning and 901.3 MB in the end (delta: 696.8 MB). Free memory was 130.4 MB in the beginning and 213.4 MB in the end (delta: -83.0 MB). Peak memory consumption was 613.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:46,239 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 147.3 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 449.79 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 103.6 MB in the beginning and 179.8 MB in the end (delta: -76.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.59 ms. Allocated memory is still 204.5 MB. Free memory was 179.8 MB in the beginning and 177.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 823.64 ms. Allocated memory is still 204.5 MB. Free memory was 177.2 MB in the beginning and 131.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18719.73 ms. Allocated memory was 204.5 MB in the beginning and 901.3 MB in the end (delta: 696.8 MB). Free memory was 130.4 MB in the beginning and 213.4 MB in the end (delta: -83.0 MB). Peak memory consumption was 613.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: (!(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 147]: 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) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((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) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state)) - 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 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_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 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && 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: ((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && 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)) || (blastFlag <= 0 && s__state == 4368)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && 4384 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((4464 == s__state && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || !(12292 <= \old(initial_state))) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 4416 == s__state)) || ((blastFlag <= 4 && s__hit == 0) && 4448 == s__state) - 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__state <= 4560) && s__hit == 0) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((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) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 165]: 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) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 136 locations, 1 error locations. Result: SAFE, OverallTime: 18.6s, OverallIterations: 26, TraceHistogramMax: 18, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, HoareTripleCheckerStatistics: 5225 SDtfs, 1861 SDslu, 3090 SDs, 0 SdLazy, 2633 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2016 GetRequests, 1977 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s 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.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 5317 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 236 NumberOfFragments, 645 HoareAnnotationTreeSize, 26 FomulaSimplifications, 18017 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1778 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 7625 NumberOfCodeBlocks, 7625 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 7594 ConstructedInterpolants, 0 QuantifiedInterpolants, 2974956 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3560 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 31 InterpolantComputations, 23 PerfectInterpolantSequences, 27114/27199 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...