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_3.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:49:15,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:15,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:15,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:15,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:15,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:15,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:15,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:15,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:15,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:15,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:15,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:15,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:15,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:15,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:15,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:15,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:15,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:15,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:15,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:15,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:15,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:15,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:15,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:15,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:15,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:15,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:15,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:15,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:15,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:15,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:15,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:15,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:15,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:15,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:15,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:15,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:15,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:15,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:15,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:15,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:15,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:49:15,937 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:15,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:15,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:15,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:15,938 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:15,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:15,939 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:15,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:15,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:15,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:15,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:15,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:15,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:15,940 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:15,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:15,941 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:15,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:15,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:15,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:15,941 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:15,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:15,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:15,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:15,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:15,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:15,943 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:15,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:15,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:15,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:16,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:16,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:16,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:16,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:16,312 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:16,312 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-10-14 23:49:16,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f40de434/de467609e03c485f8ba3d4098a8ac844/FLAG3d23a00af [2019-10-14 23:49:16,962 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:16,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-10-14 23:49:16,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f40de434/de467609e03c485f8ba3d4098a8ac844/FLAG3d23a00af [2019-10-14 23:49:17,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f40de434/de467609e03c485f8ba3d4098a8ac844 [2019-10-14 23:49:17,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:17,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:17,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:17,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:17,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:17,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:17" (1/1) ... [2019-10-14 23:49:17,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fef2b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:17, skipping insertion in model container [2019-10-14 23:49:17,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:17" (1/1) ... [2019-10-14 23:49:17,281 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:17,318 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:17,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:17,579 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:17,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:17,770 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:17,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:17 WrapperNode [2019-10-14 23:49:17,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:17,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:17,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:17,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:17,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:17" (1/1) ... [2019-10-14 23:49:17,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:17" (1/1) ... [2019-10-14 23:49:17,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:17" (1/1) ... [2019-10-14 23:49:17,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:17" (1/1) ... [2019-10-14 23:49:17,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:17" (1/1) ... [2019-10-14 23:49:17,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:17" (1/1) ... [2019-10-14 23:49:17,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:17" (1/1) ... [2019-10-14 23:49:17,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:17,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:17,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:17,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:17,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:17,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:17,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-14 23:49:17,879 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-14 23:49:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:18,023 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:49:18,496 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-14 23:49:18,496 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-14 23:49:18,508 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:18,508 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:49:18,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:18 BoogieIcfgContainer [2019-10-14 23:49:18,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:18,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:18,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:18,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:18,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:17" (1/3) ... [2019-10-14 23:49:18,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bd8bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:18, skipping insertion in model container [2019-10-14 23:49:18,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:17" (2/3) ... [2019-10-14 23:49:18,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bd8bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:18, skipping insertion in model container [2019-10-14 23:49:18,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:18" (3/3) ... [2019-10-14 23:49:18,519 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-10-14 23:49:18,530 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:18,540 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:18,553 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:18,592 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:18,593 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:18,593 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:18,593 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:18,594 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:18,594 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:18,594 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:18,594 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2019-10-14 23:49:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:49:18,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:18,643 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:18,646 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:18,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:18,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2007307722, now seen corresponding path program 1 times [2019-10-14 23:49:18,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:18,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670505531] [2019-10-14 23:49:18,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:18,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:18,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:18,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670505531] [2019-10-14 23:49:18,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:18,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:18,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408787330] [2019-10-14 23:49:18,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:18,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:18,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:18,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:18,897 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 3 states. [2019-10-14 23:49:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:19,016 INFO L93 Difference]: Finished difference Result 365 states and 622 transitions. [2019-10-14 23:49:19,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:19,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:49:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:19,033 INFO L225 Difference]: With dead ends: 365 [2019-10-14 23:49:19,033 INFO L226 Difference]: Without dead ends: 214 [2019-10-14 23:49:19,038 INFO L600 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-10-14 23:49:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-14 23:49:19,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-10-14 23:49:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-14 23:49:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 320 transitions. [2019-10-14 23:49:19,111 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 320 transitions. Word has length 29 [2019-10-14 23:49:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:19,112 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-10-14 23:49:19,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 320 transitions. [2019-10-14 23:49:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-14 23:49:19,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:19,116 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:19,116 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:19,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:19,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1381474291, now seen corresponding path program 1 times [2019-10-14 23:49:19,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:19,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840932458] [2019-10-14 23:49:19,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:19,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840932458] [2019-10-14 23:49:19,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:19,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:19,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399475242] [2019-10-14 23:49:19,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:19,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:19,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:19,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:19,213 INFO L87 Difference]: Start difference. First operand 214 states and 320 transitions. Second operand 3 states. [2019-10-14 23:49:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:19,519 INFO L93 Difference]: Finished difference Result 460 states and 698 transitions. [2019-10-14 23:49:19,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:19,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-14 23:49:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:19,523 INFO L225 Difference]: With dead ends: 460 [2019-10-14 23:49:19,524 INFO L226 Difference]: Without dead ends: 258 [2019-10-14 23:49:19,526 INFO L600 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-10-14 23:49:19,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-14 23:49:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2019-10-14 23:49:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-14 23:49:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 364 transitions. [2019-10-14 23:49:19,566 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 364 transitions. Word has length 43 [2019-10-14 23:49:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:19,567 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 364 transitions. [2019-10-14 23:49:19,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 364 transitions. [2019-10-14 23:49:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:49:19,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:19,572 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:19,572 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:19,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:19,575 INFO L82 PathProgramCache]: Analyzing trace with hash 632602009, now seen corresponding path program 1 times [2019-10-14 23:49:19,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:19,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910682741] [2019-10-14 23:49:19,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,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-10-14 23:49:19,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910682741] [2019-10-14 23:49:19,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:19,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:19,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214434029] [2019-10-14 23:49:19,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:19,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:19,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:19,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:19,700 INFO L87 Difference]: Start difference. First operand 248 states and 364 transitions. Second operand 3 states. [2019-10-14 23:49:19,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:19,944 INFO L93 Difference]: Finished difference Result 584 states and 888 transitions. [2019-10-14 23:49:19,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:19,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-14 23:49:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:19,948 INFO L225 Difference]: With dead ends: 584 [2019-10-14 23:49:19,949 INFO L226 Difference]: Without dead ends: 346 [2019-10-14 23:49:19,951 INFO L600 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-10-14 23:49:19,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-14 23:49:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 330. [2019-10-14 23:49:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-10-14 23:49:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 464 transitions. [2019-10-14 23:49:19,971 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 464 transitions. Word has length 60 [2019-10-14 23:49:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:19,972 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 464 transitions. [2019-10-14 23:49:19,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 464 transitions. [2019-10-14 23:49:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:49:19,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:19,975 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:19,976 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:19,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1172836325, now seen corresponding path program 1 times [2019-10-14 23:49:19,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:19,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020502109] [2019-10-14 23:49:19,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 23:49:20,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020502109] [2019-10-14 23:49:20,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:20,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:20,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630099838] [2019-10-14 23:49:20,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:20,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:20,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:20,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:20,046 INFO L87 Difference]: Start difference. First operand 330 states and 464 transitions. Second operand 3 states. [2019-10-14 23:49:20,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:20,211 INFO L93 Difference]: Finished difference Result 694 states and 991 transitions. [2019-10-14 23:49:20,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:20,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-14 23:49:20,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:20,215 INFO L225 Difference]: With dead ends: 694 [2019-10-14 23:49:20,215 INFO L226 Difference]: Without dead ends: 376 [2019-10-14 23:49:20,217 INFO L600 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-10-14 23:49:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-10-14 23:49:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2019-10-14 23:49:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-10-14 23:49:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 512 transitions. [2019-10-14 23:49:20,236 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 512 transitions. Word has length 60 [2019-10-14 23:49:20,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:20,237 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 512 transitions. [2019-10-14 23:49:20,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:20,238 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 512 transitions. [2019-10-14 23:49:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-14 23:49:20,241 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:20,241 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:20,242 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:20,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:20,242 INFO L82 PathProgramCache]: Analyzing trace with hash 244907033, now seen corresponding path program 1 times [2019-10-14 23:49:20,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:20,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792622447] [2019-10-14 23:49:20,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 23:49:20,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792622447] [2019-10-14 23:49:20,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:20,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:20,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755859567] [2019-10-14 23:49:20,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:20,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:20,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:20,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:20,346 INFO L87 Difference]: Start difference. First operand 368 states and 512 transitions. Second operand 3 states. [2019-10-14 23:49:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:20,589 INFO L93 Difference]: Finished difference Result 828 states and 1190 transitions. [2019-10-14 23:49:20,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:20,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-14 23:49:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:20,595 INFO L225 Difference]: With dead ends: 828 [2019-10-14 23:49:20,595 INFO L226 Difference]: Without dead ends: 470 [2019-10-14 23:49:20,596 INFO L600 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-10-14 23:49:20,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-14 23:49:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 446. [2019-10-14 23:49:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-14 23:49:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 646 transitions. [2019-10-14 23:49:20,622 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 646 transitions. Word has length 72 [2019-10-14 23:49:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:20,624 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 646 transitions. [2019-10-14 23:49:20,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 646 transitions. [2019-10-14 23:49:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-14 23:49:20,627 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:20,627 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:20,627 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:20,628 INFO L82 PathProgramCache]: Analyzing trace with hash -834546447, now seen corresponding path program 1 times [2019-10-14 23:49:20,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:20,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166857067] [2019-10-14 23:49:20,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-14 23:49:20,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166857067] [2019-10-14 23:49:20,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:20,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:20,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143418557] [2019-10-14 23:49:20,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:20,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:20,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:20,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:20,738 INFO L87 Difference]: Start difference. First operand 446 states and 646 transitions. Second operand 3 states. [2019-10-14 23:49:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:20,886 INFO L93 Difference]: Finished difference Result 928 states and 1353 transitions. [2019-10-14 23:49:20,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:20,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-14 23:49:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:20,892 INFO L225 Difference]: With dead ends: 928 [2019-10-14 23:49:20,897 INFO L226 Difference]: Without dead ends: 494 [2019-10-14 23:49:20,899 INFO L600 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-10-14 23:49:20,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-14 23:49:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2019-10-14 23:49:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-10-14 23:49:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 698 transitions. [2019-10-14 23:49:20,929 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 698 transitions. Word has length 76 [2019-10-14 23:49:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:20,931 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 698 transitions. [2019-10-14 23:49:20,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 698 transitions. [2019-10-14 23:49:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-14 23:49:20,934 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:20,934 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:20,935 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:20,935 INFO L82 PathProgramCache]: Analyzing trace with hash -532111447, now seen corresponding path program 1 times [2019-10-14 23:49:20,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:20,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210746878] [2019-10-14 23:49:20,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-14 23:49:21,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210746878] [2019-10-14 23:49:21,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:21,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:21,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846121602] [2019-10-14 23:49:21,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:21,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:21,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:21,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:21,028 INFO L87 Difference]: Start difference. First operand 488 states and 698 transitions. Second operand 3 states. [2019-10-14 23:49:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:21,076 INFO L93 Difference]: Finished difference Result 964 states and 1385 transitions. [2019-10-14 23:49:21,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:21,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-14 23:49:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:21,082 INFO L225 Difference]: With dead ends: 964 [2019-10-14 23:49:21,082 INFO L226 Difference]: Without dead ends: 725 [2019-10-14 23:49:21,083 INFO L600 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-10-14 23:49:21,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-10-14 23:49:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2019-10-14 23:49:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-10-14 23:49:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1038 transitions. [2019-10-14 23:49:21,108 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1038 transitions. Word has length 96 [2019-10-14 23:49:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:21,108 INFO L462 AbstractCegarLoop]: Abstraction has 725 states and 1038 transitions. [2019-10-14 23:49:21,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1038 transitions. [2019-10-14 23:49:21,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-14 23:49:21,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:21,116 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:21,116 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:21,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:21,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2130642131, now seen corresponding path program 1 times [2019-10-14 23:49:21,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:21,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470393342] [2019-10-14 23:49:21,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-14 23:49:21,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470393342] [2019-10-14 23:49:21,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:21,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:21,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410202908] [2019-10-14 23:49:21,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:21,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:21,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:21,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:21,202 INFO L87 Difference]: Start difference. First operand 725 states and 1038 transitions. Second operand 3 states. [2019-10-14 23:49:21,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:21,253 INFO L93 Difference]: Finished difference Result 964 states and 1382 transitions. [2019-10-14 23:49:21,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:21,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-14 23:49:21,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:21,259 INFO L225 Difference]: With dead ends: 964 [2019-10-14 23:49:21,259 INFO L226 Difference]: Without dead ends: 962 [2019-10-14 23:49:21,260 INFO L600 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-10-14 23:49:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-10-14 23:49:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2019-10-14 23:49:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-10-14 23:49:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1380 transitions. [2019-10-14 23:49:21,288 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1380 transitions. Word has length 98 [2019-10-14 23:49:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:21,288 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 1380 transitions. [2019-10-14 23:49:21,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1380 transitions. [2019-10-14 23:49:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-14 23:49:21,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:21,292 INFO L380 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:21,292 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:21,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:21,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1135672730, now seen corresponding path program 1 times [2019-10-14 23:49:21,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:21,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302681847] [2019-10-14 23:49:21,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-14 23:49:21,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302681847] [2019-10-14 23:49:21,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:21,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:21,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282553139] [2019-10-14 23:49:21,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:21,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:21,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:21,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:21,384 INFO L87 Difference]: Start difference. First operand 962 states and 1380 transitions. Second operand 3 states. [2019-10-14 23:49:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:21,555 INFO L93 Difference]: Finished difference Result 2112 states and 3080 transitions. [2019-10-14 23:49:21,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:21,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-14 23:49:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:21,561 INFO L225 Difference]: With dead ends: 2112 [2019-10-14 23:49:21,562 INFO L226 Difference]: Without dead ends: 1154 [2019-10-14 23:49:21,564 INFO L600 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-10-14 23:49:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-10-14 23:49:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1118. [2019-10-14 23:49:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-10-14 23:49:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1620 transitions. [2019-10-14 23:49:21,595 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1620 transitions. Word has length 152 [2019-10-14 23:49:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:21,595 INFO L462 AbstractCegarLoop]: Abstraction has 1118 states and 1620 transitions. [2019-10-14 23:49:21,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1620 transitions. [2019-10-14 23:49:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-14 23:49:21,600 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:21,600 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 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] [2019-10-14 23:49:21,600 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:21,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:21,601 INFO L82 PathProgramCache]: Analyzing trace with hash -862106901, now seen corresponding path program 1 times [2019-10-14 23:49:21,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:21,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623072062] [2019-10-14 23:49:21,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-14 23:49:21,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623072062] [2019-10-14 23:49:21,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:21,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:21,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925185680] [2019-10-14 23:49:21,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:21,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:21,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:21,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:21,686 INFO L87 Difference]: Start difference. First operand 1118 states and 1620 transitions. Second operand 3 states. [2019-10-14 23:49:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:21,936 INFO L93 Difference]: Finished difference Result 2330 states and 3354 transitions. [2019-10-14 23:49:21,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:21,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-14 23:49:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:21,944 INFO L225 Difference]: With dead ends: 2330 [2019-10-14 23:49:21,944 INFO L226 Difference]: Without dead ends: 1224 [2019-10-14 23:49:21,947 INFO L600 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-10-14 23:49:21,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-10-14 23:49:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1210. [2019-10-14 23:49:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-10-14 23:49:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1732 transitions. [2019-10-14 23:49:21,987 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1732 transitions. Word has length 188 [2019-10-14 23:49:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:21,987 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 1732 transitions. [2019-10-14 23:49:21,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1732 transitions. [2019-10-14 23:49:21,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-14 23:49:21,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:21,994 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2019-10-14 23:49:21,995 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:21,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:21,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2139251602, now seen corresponding path program 1 times [2019-10-14 23:49:21,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:21,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310067591] [2019-10-14 23:49:21,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-14 23:49:22,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310067591] [2019-10-14 23:49:22,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:22,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:22,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505187336] [2019-10-14 23:49:22,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:22,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:22,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:22,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:22,083 INFO L87 Difference]: Start difference. First operand 1210 states and 1732 transitions. Second operand 3 states. [2019-10-14 23:49:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:22,224 INFO L93 Difference]: Finished difference Result 2520 states and 3596 transitions. [2019-10-14 23:49:22,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:22,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-10-14 23:49:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:22,231 INFO L225 Difference]: With dead ends: 2520 [2019-10-14 23:49:22,231 INFO L226 Difference]: Without dead ends: 1322 [2019-10-14 23:49:22,234 INFO L600 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-10-14 23:49:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-10-14 23:49:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1310. [2019-10-14 23:49:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-10-14 23:49:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1852 transitions. [2019-10-14 23:49:22,269 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1852 transitions. Word has length 209 [2019-10-14 23:49:22,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:22,270 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1852 transitions. [2019-10-14 23:49:22,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1852 transitions. [2019-10-14 23:49:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-14 23:49:22,274 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:22,275 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:22,275 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:22,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1924345883, now seen corresponding path program 1 times [2019-10-14 23:49:22,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:22,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766276204] [2019-10-14 23:49:22,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:22,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:22,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-14 23:49:22,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766276204] [2019-10-14 23:49:22,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:22,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:22,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831835726] [2019-10-14 23:49:22,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:22,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:22,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:22,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:22,431 INFO L87 Difference]: Start difference. First operand 1310 states and 1852 transitions. Second operand 3 states. [2019-10-14 23:49:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:22,577 INFO L93 Difference]: Finished difference Result 2728 states and 3848 transitions. [2019-10-14 23:49:22,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:22,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-14 23:49:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:22,586 INFO L225 Difference]: With dead ends: 2728 [2019-10-14 23:49:22,586 INFO L226 Difference]: Without dead ends: 1430 [2019-10-14 23:49:22,590 INFO L600 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-10-14 23:49:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-10-14 23:49:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1422. [2019-10-14 23:49:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2019-10-14 23:49:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1984 transitions. [2019-10-14 23:49:22,629 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1984 transitions. Word has length 233 [2019-10-14 23:49:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:22,629 INFO L462 AbstractCegarLoop]: Abstraction has 1422 states and 1984 transitions. [2019-10-14 23:49:22,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:22,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1984 transitions. [2019-10-14 23:49:22,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-14 23:49:22,635 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:22,635 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:22,635 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:22,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:22,636 INFO L82 PathProgramCache]: Analyzing trace with hash -643476451, now seen corresponding path program 1 times [2019-10-14 23:49:22,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:22,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621479920] [2019-10-14 23:49:22,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:22,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:22,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-14 23:49:22,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621479920] [2019-10-14 23:49:22,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:22,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:22,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765913838] [2019-10-14 23:49:22,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:22,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:22,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:22,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:22,766 INFO L87 Difference]: Start difference. First operand 1422 states and 1984 transitions. Second operand 3 states. [2019-10-14 23:49:22,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:22,979 INFO L93 Difference]: Finished difference Result 2968 states and 4148 transitions. [2019-10-14 23:49:22,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:22,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-14 23:49:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:22,991 INFO L225 Difference]: With dead ends: 2968 [2019-10-14 23:49:22,991 INFO L226 Difference]: Without dead ends: 1558 [2019-10-14 23:49:22,996 INFO L600 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-10-14 23:49:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-10-14 23:49:23,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1546. [2019-10-14 23:49:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-10-14 23:49:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2128 transitions. [2019-10-14 23:49:23,075 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2128 transitions. Word has length 233 [2019-10-14 23:49:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:23,076 INFO L462 AbstractCegarLoop]: Abstraction has 1546 states and 2128 transitions. [2019-10-14 23:49:23,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2128 transitions. [2019-10-14 23:49:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-14 23:49:23,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:23,087 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:23,088 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:23,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1388986723, now seen corresponding path program 1 times [2019-10-14 23:49:23,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:23,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133395623] [2019-10-14 23:49:23,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-10-14 23:49:23,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133395623] [2019-10-14 23:49:23,228 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:23,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:23,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417332510] [2019-10-14 23:49:23,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:23,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:23,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:23,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:23,230 INFO L87 Difference]: Start difference. First operand 1546 states and 2128 transitions. Second operand 3 states. [2019-10-14 23:49:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:23,453 INFO L93 Difference]: Finished difference Result 3232 states and 4464 transitions. [2019-10-14 23:49:23,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:23,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-14 23:49:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:23,466 INFO L225 Difference]: With dead ends: 3232 [2019-10-14 23:49:23,466 INFO L226 Difference]: Without dead ends: 1698 [2019-10-14 23:49:23,471 INFO L600 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-10-14 23:49:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-10-14 23:49:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1690. [2019-10-14 23:49:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-10-14 23:49:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2292 transitions. [2019-10-14 23:49:23,536 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2292 transitions. Word has length 263 [2019-10-14 23:49:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:23,537 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 2292 transitions. [2019-10-14 23:49:23,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2292 transitions. [2019-10-14 23:49:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-14 23:49:23,547 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:23,547 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:23,548 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:23,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:23,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1178835611, now seen corresponding path program 1 times [2019-10-14 23:49:23,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:23,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245196761] [2019-10-14 23:49:23,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-10-14 23:49:23,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245196761] [2019-10-14 23:49:23,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:23,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:23,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120654189] [2019-10-14 23:49:23,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:23,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:23,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:23,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:23,745 INFO L87 Difference]: Start difference. First operand 1690 states and 2292 transitions. Second operand 3 states. [2019-10-14 23:49:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:23,816 INFO L93 Difference]: Finished difference Result 5038 states and 6836 transitions. [2019-10-14 23:49:23,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:23,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-14 23:49:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:23,840 INFO L225 Difference]: With dead ends: 5038 [2019-10-14 23:49:23,840 INFO L226 Difference]: Without dead ends: 3360 [2019-10-14 23:49:23,847 INFO L600 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-10-14 23:49:23,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2019-10-14 23:49:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3358. [2019-10-14 23:49:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3358 states. [2019-10-14 23:49:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4555 transitions. [2019-10-14 23:49:23,972 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4555 transitions. Word has length 263 [2019-10-14 23:49:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:23,973 INFO L462 AbstractCegarLoop]: Abstraction has 3358 states and 4555 transitions. [2019-10-14 23:49:23,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4555 transitions. [2019-10-14 23:49:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-14 23:49:23,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:23,991 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:23,991 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:23,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:23,992 INFO L82 PathProgramCache]: Analyzing trace with hash 554282629, now seen corresponding path program 1 times [2019-10-14 23:49:23,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:23,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930747423] [2019-10-14 23:49:23,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-10-14 23:49:24,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930747423] [2019-10-14 23:49:24,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:24,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:24,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070766794] [2019-10-14 23:49:24,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:24,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:24,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:24,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,158 INFO L87 Difference]: Start difference. First operand 3358 states and 4555 transitions. Second operand 3 states. [2019-10-14 23:49:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:24,381 INFO L93 Difference]: Finished difference Result 6852 states and 9306 transitions. [2019-10-14 23:49:24,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:24,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-10-14 23:49:24,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:24,401 INFO L225 Difference]: With dead ends: 6852 [2019-10-14 23:49:24,401 INFO L226 Difference]: Without dead ends: 3506 [2019-10-14 23:49:24,445 INFO L600 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-10-14 23:49:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2019-10-14 23:49:24,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3490. [2019-10-14 23:49:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-10-14 23:49:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4707 transitions. [2019-10-14 23:49:24,551 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4707 transitions. Word has length 287 [2019-10-14 23:49:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:24,551 INFO L462 AbstractCegarLoop]: Abstraction has 3490 states and 4707 transitions. [2019-10-14 23:49:24,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4707 transitions. [2019-10-14 23:49:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-14 23:49:24,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:24,563 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:24,564 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:24,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:24,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1163110431, now seen corresponding path program 1 times [2019-10-14 23:49:24,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:24,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225340722] [2019-10-14 23:49:24,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 541 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-14 23:49:24,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225340722] [2019-10-14 23:49:24,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:24,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:24,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743864877] [2019-10-14 23:49:24,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:24,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:24,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:24,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,682 INFO L87 Difference]: Start difference. First operand 3490 states and 4707 transitions. Second operand 3 states. [2019-10-14 23:49:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:24,898 INFO L93 Difference]: Finished difference Result 7360 states and 10062 transitions. [2019-10-14 23:49:24,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:24,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-10-14 23:49:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:24,926 INFO L225 Difference]: With dead ends: 7360 [2019-10-14 23:49:24,926 INFO L226 Difference]: Without dead ends: 3882 [2019-10-14 23:49:24,937 INFO L600 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-10-14 23:49:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2019-10-14 23:49:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3802. [2019-10-14 23:49:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3802 states. [2019-10-14 23:49:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 5075 transitions. [2019-10-14 23:49:25,089 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 5075 transitions. Word has length 298 [2019-10-14 23:49:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:25,090 INFO L462 AbstractCegarLoop]: Abstraction has 3802 states and 5075 transitions. [2019-10-14 23:49:25,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 5075 transitions. [2019-10-14 23:49:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-14 23:49:25,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:25,110 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:25,111 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:25,111 INFO L82 PathProgramCache]: Analyzing trace with hash -121210371, now seen corresponding path program 1 times [2019-10-14 23:49:25,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:25,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470747450] [2019-10-14 23:49:25,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-14 23:49:25,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470747450] [2019-10-14 23:49:25,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:25,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:25,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389730986] [2019-10-14 23:49:25,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:25,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:25,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:25,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:25,346 INFO L87 Difference]: Start difference. First operand 3802 states and 5075 transitions. Second operand 3 states. [2019-10-14 23:49:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:25,652 INFO L93 Difference]: Finished difference Result 7992 states and 10606 transitions. [2019-10-14 23:49:25,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:25,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-10-14 23:49:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:25,695 INFO L225 Difference]: With dead ends: 7992 [2019-10-14 23:49:25,696 INFO L226 Difference]: Without dead ends: 4202 [2019-10-14 23:49:25,704 INFO L600 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-10-14 23:49:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2019-10-14 23:49:25,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 3922. [2019-10-14 23:49:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3922 states. [2019-10-14 23:49:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 5219 transitions. [2019-10-14 23:49:25,813 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 5219 transitions. Word has length 311 [2019-10-14 23:49:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:25,814 INFO L462 AbstractCegarLoop]: Abstraction has 3922 states and 5219 transitions. [2019-10-14 23:49:25,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 5219 transitions. [2019-10-14 23:49:25,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-14 23:49:25,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:25,826 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:25,827 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:25,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:25,827 INFO L82 PathProgramCache]: Analyzing trace with hash -828607418, now seen corresponding path program 1 times [2019-10-14 23:49:25,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:25,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713497364] [2019-10-14 23:49:25,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 706 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-10-14 23:49:26,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713497364] [2019-10-14 23:49:26,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:26,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:26,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501730805] [2019-10-14 23:49:26,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:26,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:26,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:26,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:26,037 INFO L87 Difference]: Start difference. First operand 3922 states and 5219 transitions. Second operand 3 states. [2019-10-14 23:49:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:26,129 INFO L93 Difference]: Finished difference Result 11238 states and 15033 transitions. [2019-10-14 23:49:26,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:26,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-10-14 23:49:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:26,148 INFO L225 Difference]: With dead ends: 11238 [2019-10-14 23:49:26,148 INFO L226 Difference]: Without dead ends: 7328 [2019-10-14 23:49:26,158 INFO L600 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-10-14 23:49:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7328 states. [2019-10-14 23:49:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7328 to 7326. [2019-10-14 23:49:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7326 states. [2019-10-14 23:49:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 9805 transitions. [2019-10-14 23:49:26,340 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 9805 transitions. Word has length 312 [2019-10-14 23:49:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:26,340 INFO L462 AbstractCegarLoop]: Abstraction has 7326 states and 9805 transitions. [2019-10-14 23:49:26,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 9805 transitions. [2019-10-14 23:49:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-14 23:49:26,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:26,356 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:26,356 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:26,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:26,357 INFO L82 PathProgramCache]: Analyzing trace with hash -935849662, now seen corresponding path program 1 times [2019-10-14 23:49:26,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:26,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499068352] [2019-10-14 23:49:26,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:26,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:26,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 710 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-10-14 23:49:26,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499068352] [2019-10-14 23:49:26,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:26,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:26,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896623857] [2019-10-14 23:49:26,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:26,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:26,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:26,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:26,481 INFO L87 Difference]: Start difference. First operand 7326 states and 9805 transitions. Second operand 3 states. [2019-10-14 23:49:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:26,724 INFO L93 Difference]: Finished difference Result 14648 states and 19586 transitions. [2019-10-14 23:49:26,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:26,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-10-14 23:49:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:26,745 INFO L225 Difference]: With dead ends: 14648 [2019-10-14 23:49:26,746 INFO L226 Difference]: Without dead ends: 7334 [2019-10-14 23:49:26,762 INFO L600 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-10-14 23:49:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7334 states. [2019-10-14 23:49:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7334 to 7302. [2019-10-14 23:49:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7302 states. [2019-10-14 23:49:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 9525 transitions. [2019-10-14 23:49:26,990 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 9525 transitions. Word has length 313 [2019-10-14 23:49:26,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:26,991 INFO L462 AbstractCegarLoop]: Abstraction has 7302 states and 9525 transitions. [2019-10-14 23:49:26,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 9525 transitions. [2019-10-14 23:49:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-14 23:49:27,007 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:27,007 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:27,007 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:27,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:27,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1555626477, now seen corresponding path program 1 times [2019-10-14 23:49:27,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:27,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906146122] [2019-10-14 23:49:27,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:27,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:27,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 765 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-14 23:49:27,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906146122] [2019-10-14 23:49:27,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175779556] [2019-10-14 23:49:27,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:27,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:49:27,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2019-10-14 23:49:27,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:27,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:49:27,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800115829] [2019-10-14 23:49:27,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:27,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:27,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:27,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:27,705 INFO L87 Difference]: Start difference. First operand 7302 states and 9525 transitions. Second operand 3 states. [2019-10-14 23:49:27,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:27,870 INFO L93 Difference]: Finished difference Result 18220 states and 23754 transitions. [2019-10-14 23:49:27,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:27,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-10-14 23:49:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:27,897 INFO L225 Difference]: With dead ends: 18220 [2019-10-14 23:49:27,898 INFO L226 Difference]: Without dead ends: 10930 [2019-10-14 23:49:27,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10930 states. [2019-10-14 23:49:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10930 to 10930. [2019-10-14 23:49:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10930 states. [2019-10-14 23:49:28,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10930 states to 10930 states and 14229 transitions. [2019-10-14 23:49:28,242 INFO L78 Accepts]: Start accepts. Automaton has 10930 states and 14229 transitions. Word has length 336 [2019-10-14 23:49:28,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:28,243 INFO L462 AbstractCegarLoop]: Abstraction has 10930 states and 14229 transitions. [2019-10-14 23:49:28,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:28,243 INFO L276 IsEmpty]: Start isEmpty. Operand 10930 states and 14229 transitions. [2019-10-14 23:49:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-10-14 23:49:28,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:28,265 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:28,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:28,479 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:28,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash 451618901, now seen corresponding path program 1 times [2019-10-14 23:49:28,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:28,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283136547] [2019-10-14 23:49:28,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:28,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:28,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:28,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 767 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-14 23:49:28,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283136547] [2019-10-14 23:49:28,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261040525] [2019-10-14 23:49:28,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:28,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:49:28,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1245 trivial. 0 not checked. [2019-10-14 23:49:29,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:29,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-10-14 23:49:29,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771132895] [2019-10-14 23:49:29,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:29,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:29,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:49:29,196 INFO L87 Difference]: Start difference. First operand 10930 states and 14229 transitions. Second operand 5 states. [2019-10-14 23:49:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:29,729 INFO L93 Difference]: Finished difference Result 22074 states and 28747 transitions. [2019-10-14 23:49:29,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:29,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 338 [2019-10-14 23:49:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:29,767 INFO L225 Difference]: With dead ends: 22074 [2019-10-14 23:49:29,767 INFO L226 Difference]: Without dead ends: 11128 [2019-10-14 23:49:29,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 338 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-10-14 23:49:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11128 states. [2019-10-14 23:49:30,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11128 to 10936. [2019-10-14 23:49:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10936 states. [2019-10-14 23:49:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10936 states to 10936 states and 14237 transitions. [2019-10-14 23:49:30,219 INFO L78 Accepts]: Start accepts. Automaton has 10936 states and 14237 transitions. Word has length 338 [2019-10-14 23:49:30,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:30,220 INFO L462 AbstractCegarLoop]: Abstraction has 10936 states and 14237 transitions. [2019-10-14 23:49:30,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 10936 states and 14237 transitions. [2019-10-14 23:49:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-14 23:49:30,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:30,245 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:30,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:30,460 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:30,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:30,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1817523371, now seen corresponding path program 1 times [2019-10-14 23:49:30,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:30,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507234991] [2019-10-14 23:49:30,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:30,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:30,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-14 23:49:30,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507234991] [2019-10-14 23:49:30,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048750184] [2019-10-14 23:49:30,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:30,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:30,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-14 23:49:30,925 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:30,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:30,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288994530] [2019-10-14 23:49:30,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:30,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:30,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:30,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:30,930 INFO L87 Difference]: Start difference. First operand 10936 states and 14237 transitions. Second operand 4 states. [2019-10-14 23:49:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:31,434 INFO L93 Difference]: Finished difference Result 21712 states and 28271 transitions. [2019-10-14 23:49:31,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:31,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2019-10-14 23:49:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:31,470 INFO L225 Difference]: With dead ends: 21712 [2019-10-14 23:49:31,471 INFO L226 Difference]: Without dead ends: 16372 [2019-10-14 23:49:31,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 354 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-10-14 23:49:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16372 states. [2019-10-14 23:49:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16372 to 12568. [2019-10-14 23:49:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12568 states. [2019-10-14 23:49:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12568 states to 12568 states and 16457 transitions. [2019-10-14 23:49:31,786 INFO L78 Accepts]: Start accepts. Automaton has 12568 states and 16457 transitions. Word has length 350 [2019-10-14 23:49:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:31,786 INFO L462 AbstractCegarLoop]: Abstraction has 12568 states and 16457 transitions. [2019-10-14 23:49:31,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 12568 states and 16457 transitions. [2019-10-14 23:49:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-10-14 23:49:31,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:31,812 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:32,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:32,018 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash -299155883, now seen corresponding path program 2 times [2019-10-14 23:49:32,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:32,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215736840] [2019-10-14 23:49:32,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:32,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:32,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-14 23:49:32,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215736840] [2019-10-14 23:49:32,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659390081] [2019-10-14 23:49:32,276 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:32,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:49:32,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:49:32,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:32,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-10-14 23:49:32,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:32,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:49:32,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688153916] [2019-10-14 23:49:32,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:32,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:32,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:32,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:32,477 INFO L87 Difference]: Start difference. First operand 12568 states and 16457 transitions. Second operand 3 states. [2019-10-14 23:49:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:32,766 INFO L93 Difference]: Finished difference Result 24326 states and 31258 transitions. [2019-10-14 23:49:32,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:32,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-10-14 23:49:32,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:32,793 INFO L225 Difference]: With dead ends: 24326 [2019-10-14 23:49:32,793 INFO L226 Difference]: Without dead ends: 11776 [2019-10-14 23:49:32,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11776 states. [2019-10-14 23:49:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11776 to 11416. [2019-10-14 23:49:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11416 states. [2019-10-14 23:49:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11416 states to 11416 states and 14321 transitions. [2019-10-14 23:49:33,048 INFO L78 Accepts]: Start accepts. Automaton has 11416 states and 14321 transitions. Word has length 362 [2019-10-14 23:49:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:33,049 INFO L462 AbstractCegarLoop]: Abstraction has 11416 states and 14321 transitions. [2019-10-14 23:49:33,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 11416 states and 14321 transitions. [2019-10-14 23:49:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-10-14 23:49:33,066 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:33,067 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:33,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:33,270 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:33,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:33,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2019228612, now seen corresponding path program 1 times [2019-10-14 23:49:33,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:33,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838717480] [2019-10-14 23:49:33,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:33,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:33,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-14 23:49:33,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838717480] [2019-10-14 23:49:33,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779146856] [2019-10-14 23:49:33,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:33,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:33,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-14 23:49:33,792 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:33,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:33,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277706699] [2019-10-14 23:49:33,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:33,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:33,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:33,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:33,795 INFO L87 Difference]: Start difference. First operand 11416 states and 14321 transitions. Second operand 4 states. [2019-10-14 23:49:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:34,248 INFO L93 Difference]: Finished difference Result 25352 states and 31647 transitions. [2019-10-14 23:49:34,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:49:34,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2019-10-14 23:49:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:34,278 INFO L225 Difference]: With dead ends: 25352 [2019-10-14 23:49:34,278 INFO L226 Difference]: Without dead ends: 13942 [2019-10-14 23:49:34,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 380 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-10-14 23:49:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13942 states. [2019-10-14 23:49:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13942 to 11694. [2019-10-14 23:49:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11694 states. [2019-10-14 23:49:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11694 states to 11694 states and 14578 transitions. [2019-10-14 23:49:34,539 INFO L78 Accepts]: Start accepts. Automaton has 11694 states and 14578 transitions. Word has length 376 [2019-10-14 23:49:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:34,539 INFO L462 AbstractCegarLoop]: Abstraction has 11694 states and 14578 transitions. [2019-10-14 23:49:34,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 11694 states and 14578 transitions. [2019-10-14 23:49:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-10-14 23:49:34,562 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:34,563 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:34,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:34,768 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:34,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:34,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1965718292, now seen corresponding path program 1 times [2019-10-14 23:49:34,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:34,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568721400] [2019-10-14 23:49:34,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:34,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:34,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-14 23:49:34,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568721400] [2019-10-14 23:49:34,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:34,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:34,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769903559] [2019-10-14 23:49:34,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:34,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:34,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:34,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:34,949 INFO L87 Difference]: Start difference. First operand 11694 states and 14578 transitions. Second operand 3 states. [2019-10-14 23:49:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:35,324 INFO L93 Difference]: Finished difference Result 22624 states and 27701 transitions. [2019-10-14 23:49:35,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:35,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 415 [2019-10-14 23:49:35,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:35,336 INFO L225 Difference]: With dead ends: 22624 [2019-10-14 23:49:35,337 INFO L226 Difference]: Without dead ends: 5426 [2019-10-14 23:49:35,349 INFO L600 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-10-14 23:49:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2019-10-14 23:49:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 5193. [2019-10-14 23:49:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5193 states. [2019-10-14 23:49:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 6407 transitions. [2019-10-14 23:49:35,436 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 6407 transitions. Word has length 415 [2019-10-14 23:49:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:35,436 INFO L462 AbstractCegarLoop]: Abstraction has 5193 states and 6407 transitions. [2019-10-14 23:49:35,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 6407 transitions. [2019-10-14 23:49:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-10-14 23:49:35,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:35,445 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:35,445 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:35,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:35,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1027355828, now seen corresponding path program 1 times [2019-10-14 23:49:35,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:35,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551815496] [2019-10-14 23:49:35,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:35,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:35,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-10-14 23:49:35,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551815496] [2019-10-14 23:49:35,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768459950] [2019-10-14 23:49:35,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:35,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:35,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-10-14 23:49:36,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:36,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:49:36,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037610798] [2019-10-14 23:49:36,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:36,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:36,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:36,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:36,087 INFO L87 Difference]: Start difference. First operand 5193 states and 6407 transitions. Second operand 3 states. [2019-10-14 23:49:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:36,142 INFO L93 Difference]: Finished difference Result 5268 states and 6502 transitions. [2019-10-14 23:49:36,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:36,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-10-14 23:49:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:36,153 INFO L225 Difference]: With dead ends: 5268 [2019-10-14 23:49:36,153 INFO L226 Difference]: Without dead ends: 5192 [2019-10-14 23:49:36,156 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2019-10-14 23:49:36,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 5119. [2019-10-14 23:49:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5119 states. [2019-10-14 23:49:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5119 states to 5119 states and 6316 transitions. [2019-10-14 23:49:36,245 INFO L78 Accepts]: Start accepts. Automaton has 5119 states and 6316 transitions. Word has length 499 [2019-10-14 23:49:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:36,246 INFO L462 AbstractCegarLoop]: Abstraction has 5119 states and 6316 transitions. [2019-10-14 23:49:36,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 5119 states and 6316 transitions. [2019-10-14 23:49:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-10-14 23:49:36,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:36,256 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:36,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:36,462 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:36,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash -241116614, now seen corresponding path program 1 times [2019-10-14 23:49:36,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:36,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775770280] [2019-10-14 23:49:36,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:36,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:36,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-10-14 23:49:36,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775770280] [2019-10-14 23:49:36,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727168094] [2019-10-14 23:49:36,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:36,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:36,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-10-14 23:49:37,218 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:37,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:37,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520273236] [2019-10-14 23:49:37,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:37,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:37,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:37,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:37,220 INFO L87 Difference]: Start difference. First operand 5119 states and 6316 transitions. Second operand 4 states. [2019-10-14 23:49:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:37,401 INFO L93 Difference]: Finished difference Result 5614 states and 6940 transitions. [2019-10-14 23:49:37,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:49:37,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 609 [2019-10-14 23:49:37,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:37,406 INFO L225 Difference]: With dead ends: 5614 [2019-10-14 23:49:37,406 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:49:37,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 613 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-10-14 23:49:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:49:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:49:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:49:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:49:37,415 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 609 [2019-10-14 23:49:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:37,415 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:49:37,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:49:37,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:49:37,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:37,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:49:38,889 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 601 DAG size of output: 131 [2019-10-14 23:49:39,450 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-10-14 23:49:40,588 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-10-14 23:49:40,935 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2019-10-14 23:49:41,278 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2019-10-14 23:49:41,482 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-10-14 23:49:41,721 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-10-14 23:49:41,724 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:49:41,724 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:49:41,724 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed. [2019-10-14 23:49:41,724 INFO L443 ceAbstractionStarter]: For program point L366-2(lines 366 370) no Hoare annotation was computed. [2019-10-14 23:49:41,724 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 593) no Hoare annotation was computed. [2019-10-14 23:49:41,724 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 540) no Hoare annotation was computed. [2019-10-14 23:49:41,724 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 551) no Hoare annotation was computed. [2019-10-14 23:49:41,725 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 562) no Hoare annotation was computed. [2019-10-14 23:49:41,725 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 590) no Hoare annotation was computed. [2019-10-14 23:49:41,725 INFO L443 ceAbstractionStarter]: For program point L500-1(lines 198 528) no Hoare annotation was computed. [2019-10-14 23:49:41,725 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 340) no Hoare annotation was computed. [2019-10-14 23:49:41,725 INFO L443 ceAbstractionStarter]: For program point L302-1(lines 302 316) no Hoare annotation was computed. [2019-10-14 23:49:41,725 INFO L439 ceAbstractionStarter]: At program point L203(lines 100 563) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-10-14 23:49:41,725 INFO L439 ceAbstractionStarter]: At program point L170(lines 166 541) 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)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-10-14 23:49:41,725 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-10-14 23:49:41,726 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 576) no Hoare annotation was computed. [2019-10-14 23:49:41,726 INFO L443 ceAbstractionStarter]: For program point L600-2(lines 600 604) no Hoare annotation was computed. [2019-10-14 23:49:41,726 INFO L443 ceAbstractionStarter]: For program point L567-2(lines 566 588) no Hoare annotation was computed. [2019-10-14 23:49:41,726 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-10-14 23:49:41,726 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 539) no Hoare annotation was computed. [2019-10-14 23:49:41,726 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 550) no Hoare annotation was computed. [2019-10-14 23:49:41,726 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 561) no Hoare annotation was computed. [2019-10-14 23:49:41,726 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 573) no Hoare annotation was computed. [2019-10-14 23:49:41,727 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 442) no Hoare annotation was computed. [2019-10-14 23:49:41,727 INFO L439 ceAbstractionStarter]: At program point L140(lines 136 551) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)))) [2019-10-14 23:49:41,727 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-10-14 23:49:41,728 INFO L443 ceAbstractionStarter]: For program point L471(lines 471 475) no Hoare annotation was computed. [2019-10-14 23:49:41,728 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-10-14 23:49:41,728 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 304 316) no Hoare annotation was computed. [2019-10-14 23:49:41,729 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 505 509) no Hoare annotation was computed. [2019-10-14 23:49:41,729 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 410) no Hoare annotation was computed. [2019-10-14 23:49:41,729 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 212) no Hoare annotation was computed. [2019-10-14 23:49:41,729 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 538) no Hoare annotation was computed. [2019-10-14 23:49:41,729 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 549) no Hoare annotation was computed. [2019-10-14 23:49:41,729 INFO L443 ceAbstractionStarter]: For program point L208-2(lines 198 528) no Hoare annotation was computed. [2019-10-14 23:49:41,729 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 560) no Hoare annotation was computed. [2019-10-14 23:49:41,730 INFO L439 ceAbstractionStarter]: At program point L176(lines 172 539) 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)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3))) [2019-10-14 23:49:41,730 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-10-14 23:49:41,730 INFO L443 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-10-14 23:49:41,730 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 249) no Hoare annotation was computed. [2019-10-14 23:49:41,730 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 537) no Hoare annotation was computed. [2019-10-14 23:49:41,730 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 548) no Hoare annotation was computed. [2019-10-14 23:49:41,730 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 559) no Hoare annotation was computed. [2019-10-14 23:49:41,730 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-10-14 23:49:41,730 INFO L443 ceAbstractionStarter]: For program point L476-2(lines 476 480) no Hoare annotation was computed. [2019-10-14 23:49:41,730 INFO L439 ceAbstractionStarter]: At program point L146(lines 142 549) 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)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-10-14 23:49:41,731 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 382) no Hoare annotation was computed. [2019-10-14 23:49:41,731 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-10-14 23:49:41,731 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 287) no Hoare annotation was computed. [2019-10-14 23:49:41,731 INFO L439 ceAbstractionStarter]: At program point L346(lines 60 608) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-10-14 23:49:41,731 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 536) no Hoare annotation was computed. [2019-10-14 23:49:41,731 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 547) no Hoare annotation was computed. [2019-10-14 23:49:41,731 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 558) no Hoare annotation was computed. [2019-10-14 23:49:41,731 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 584) no Hoare annotation was computed. [2019-10-14 23:49:41,731 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-10-14 23:49:41,731 INFO L443 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-10-14 23:49:41,732 INFO L439 ceAbstractionStarter]: At program point L182(lines 178 537) 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)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-10-14 23:49:41,732 INFO L439 ceAbstractionStarter]: At program point L116(lines 112 559) 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-10-14 23:49:41,732 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-10-14 23:49:41,732 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-10-14 23:49:41,732 INFO L443 ceAbstractionStarter]: For program point L282-2(lines 198 528) no Hoare annotation was computed. [2019-10-14 23:49:41,732 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-10-14 23:49:41,732 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 7 609) the Hoare annotation is: true [2019-10-14 23:49:41,732 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 535) no Hoare annotation was computed. [2019-10-14 23:49:41,732 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 546) no Hoare annotation was computed. [2019-10-14 23:49:41,732 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 557) no Hoare annotation was computed. [2019-10-14 23:49:41,733 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-10-14 23:49:41,733 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 354) no Hoare annotation was computed. [2019-10-14 23:49:41,733 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 484 496) no Hoare annotation was computed. [2019-10-14 23:49:41,733 INFO L443 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-10-14 23:49:41,733 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 237) no Hoare annotation was computed. [2019-10-14 23:49:41,733 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 534) no Hoare annotation was computed. [2019-10-14 23:49:41,733 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 545) no Hoare annotation was computed. [2019-10-14 23:49:41,733 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 198 528) no Hoare annotation was computed. [2019-10-14 23:49:41,733 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 556) no Hoare annotation was computed. [2019-10-14 23:49:41,733 INFO L439 ceAbstractionStarter]: At program point L188(lines 184 535) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~blastFlag~0 2)) (.cse1 (<= 4560 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse1 .cse3 (not .cse2)))) [2019-10-14 23:49:41,733 INFO L439 ceAbstractionStarter]: At program point L122(lines 118 557) 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-10-14 23:49:41,734 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-10-14 23:49:41,734 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 227) no Hoare annotation was computed. [2019-10-14 23:49:41,734 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 492) no Hoare annotation was computed. [2019-10-14 23:49:41,734 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 465) no Hoare annotation was computed. [2019-10-14 23:49:41,734 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 454 465) no Hoare annotation was computed. [2019-10-14 23:49:41,734 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 533) no Hoare annotation was computed. [2019-10-14 23:49:41,734 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 544) no Hoare annotation was computed. [2019-10-14 23:49:41,734 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 555) no Hoare annotation was computed. [2019-10-14 23:49:41,734 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 393) no Hoare annotation was computed. [2019-10-14 23:49:41,734 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-10-14 23:49:41,734 INFO L443 ceAbstractionStarter]: For program point L323-2(lines 198 528) no Hoare annotation was computed. [2019-10-14 23:49:41,734 INFO L439 ceAbstractionStarter]: At program point L191(lines 190 533) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse2 (<= ssl3_connect_~s__state~0 4352)) (.cse3 (<= 4352 ssl3_connect_~s__state~0)) (.cse4 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2 .cse3 (not .cse4)))) [2019-10-14 23:49:41,735 INFO L439 ceAbstractionStarter]: At program point L158(lines 148 547) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3))) [2019-10-14 23:49:41,735 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 7 609) no Hoare annotation was computed. [2019-10-14 23:49:41,735 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 462) no Hoare annotation was computed. [2019-10-14 23:49:41,735 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 262) no Hoare annotation was computed. [2019-10-14 23:49:41,735 INFO L443 ceAbstractionStarter]: For program point L258-2(lines 198 528) no Hoare annotation was computed. [2019-10-14 23:49:41,735 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 7 609) no Hoare annotation was computed. [2019-10-14 23:49:41,735 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 532) no Hoare annotation was computed. [2019-10-14 23:49:41,735 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 543) no Hoare annotation was computed. [2019-10-14 23:49:41,735 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 554) no Hoare annotation was computed. [2019-10-14 23:49:41,735 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 60 608) no Hoare annotation was computed. [2019-10-14 23:49:41,736 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-10-14 23:49:41,736 INFO L443 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-10-14 23:49:41,736 INFO L446 ceAbstractionStarter]: At program point L194(lines 193 532) the Hoare annotation is: true [2019-10-14 23:49:41,736 INFO L439 ceAbstractionStarter]: At program point L128(lines 124 555) the Hoare annotation is: (let ((.cse0 (<= 4352 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 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-10-14 23:49:41,736 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-10-14 23:49:41,736 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-10-14 23:49:41,736 INFO L443 ceAbstractionStarter]: For program point L426-2(lines 198 528) no Hoare annotation was computed. [2019-10-14 23:49:41,736 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 233) no Hoare annotation was computed. [2019-10-14 23:49:41,736 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-10-14 23:49:41,736 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 542) no Hoare annotation was computed. [2019-10-14 23:49:41,736 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 553) no Hoare annotation was computed. [2019-10-14 23:49:41,736 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 564) no Hoare annotation was computed. [2019-10-14 23:49:41,737 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 400) no Hoare annotation was computed. [2019-10-14 23:49:41,737 INFO L443 ceAbstractionStarter]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2019-10-14 23:49:41,737 INFO L446 ceAbstractionStarter]: At program point L197(lines 196 531) the Hoare annotation is: true [2019-10-14 23:49:41,737 INFO L439 ceAbstractionStarter]: At program point L164(lines 160 543) 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)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-10-14 23:49:41,737 INFO L439 ceAbstractionStarter]: At program point L98(lines 97 564) 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-10-14 23:49:41,737 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-10-14 23:49:41,738 INFO L439 ceAbstractionStarter]: At program point L529(lines 94 595) the Hoare annotation is: (let ((.cse3 (= ssl3_connect_~s__hit~0 0))) (let ((.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ssl3_connect_~s__state~0)) (.cse7 (= 4448 ssl3_connect_~s__state~0)) (.cse10 (not .cse3)) (.cse16 (<= 4560 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4560)) (.cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4512)) (.cse8 (<= ssl3_connect_~s__state~0 3)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse11 (= ssl3_connect_~s__state~0 4480)) (.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse15 (= ssl3_connect_~s__state~0 4496)) (.cse19 (= 4416 ssl3_connect_~s__state~0)) (.cse14 (= 4400 ssl3_connect_~s__state~0)) (.cse18 (= 4464 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~blastFlag~0 4)) (.cse5 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse20 (= ssl3_connect_~s__state~0 4432))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse3 .cse7) (and .cse8 .cse6 .cse0) (and .cse0 .cse9 .cse3 .cse5) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse10) (and .cse6 .cse3 .cse11) (and .cse8 .cse6 .cse3) (and .cse0 .cse12 .cse3 .cse5) (and .cse6 .cse9) (and .cse0 .cse3 .cse7 .cse5) (and .cse0 .cse3 .cse5 .cse11) (and .cse0 .cse13 .cse14 .cse3 .cse5) (and .cse6 .cse12) (and .cse6 .cse15 .cse3) (and .cse6 .cse0 .cse16 .cse17 .cse4) (and .cse6 .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse13 .cse3 .cse7 .cse5) (and .cse6 .cse16 .cse17 .cse10) (and .cse0 .cse18 .cse3 .cse5) (and .cse0 .cse16 .cse3 .cse17 .cse4 .cse5) (and .cse15 .cse13 .cse3 .cse5) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse9 .cse13 .cse3 .cse5) (and .cse8 .cse0 .cse5) (and .cse13 .cse3 .cse5 .cse19) (and .cse12 .cse13 .cse3 .cse5) (and .cse13 .cse3 .cse5 .cse11) (and .cse6 (= 4384 ssl3_connect_~s__state~0)) (and .cse0 .cse15 .cse3 .cse5) (and .cse6 .cse18 .cse3) (and .cse6 .cse3 .cse19) (and .cse6 .cse14 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse20 .cse13 .cse3 .cse5) (and .cse18 .cse13 .cse3 .cse5) (and .cse6 .cse20 .cse3)))) [2019-10-14 23:49:41,738 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 541) no Hoare annotation was computed. [2019-10-14 23:49:41,738 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 552) no Hoare annotation was computed. [2019-10-14 23:49:41,738 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 563) no Hoare annotation was computed. [2019-10-14 23:49:41,738 INFO L446 ceAbstractionStarter]: At program point L596(lines 93 597) the Hoare annotation is: true [2019-10-14 23:49:41,739 INFO L439 ceAbstractionStarter]: At program point L134(lines 130 553) the Hoare annotation is: (let ((.cse0 (<= 4352 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_~blastFlag~0 4) .cse1 .cse2 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-10-14 23:49:41,739 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:49:41,739 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:49:41,739 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:49:41,739 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:49:41,739 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 610 620) the Hoare annotation is: true [2019-10-14 23:49:41,739 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 610 620) no Hoare annotation was computed. [2019-10-14 23:49:41,739 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 610 620) no Hoare annotation was computed. [2019-10-14 23:49:41,740 INFO L439 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (<= 12292 main_~s~0) [2019-10-14 23:49:41,740 INFO L443 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2019-10-14 23:49:41,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:49:41 BoogieIcfgContainer [2019-10-14 23:49:41,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:49:41,769 INFO L168 Benchmark]: Toolchain (without parser) took 24505.89 ms. Allocated memory was 137.4 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 101.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 997.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:41,770 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:49:41,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.46 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 177.3 MB in the end (delta: -75.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:41,771 INFO L168 Benchmark]: Boogie Preprocessor took 48.84 ms. Allocated memory is still 201.3 MB. Free memory was 177.3 MB in the beginning and 175.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:41,771 INFO L168 Benchmark]: RCFGBuilder took 689.82 ms. Allocated memory is still 201.3 MB. Free memory was 175.2 MB in the beginning and 133.6 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:41,772 INFO L168 Benchmark]: TraceAbstraction took 23255.98 ms. Allocated memory was 201.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 132.9 MB in the beginning and 1.1 GB in the end (delta: -969.8 MB). Peak memory consumption was 964.2 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:41,775 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.50 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 506.46 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 177.3 MB in the end (delta: -75.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.84 ms. Allocated memory is still 201.3 MB. Free memory was 177.3 MB in the beginning and 175.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 689.82 ms. Allocated memory is still 201.3 MB. Free memory was 175.2 MB in the beginning and 133.6 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23255.98 ms. Allocated memory was 201.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 132.9 MB in the beginning and 1.1 GB in the end (delta: -969.8 MB). Peak memory consumption was 964.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: 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: 136]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 2) && s__hit == 0) && s__state <= 4560)) || ((((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 178]: 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) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 2) && s__hit == 0) && s__state <= 4560)) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 160]: 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) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) && s__hit == 0)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) || ((blastFlag <= 2 && s__hit == 0) && 4448 == s__state)) || ((s__state <= 3 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 4560)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((blastFlag <= 2 && s__hit == 0) && s__state == 4480)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (blastFlag <= 2 && s__state == 4512)) || (((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state == 4480)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && 4400 == s__state) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (blastFlag <= 2 && s__state == 4528)) || ((blastFlag <= 2 && s__state == 4496) && s__hit == 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && 4560 <= s__state) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 4 && s__hit == 0) && 4448 == s__state) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__state == 4496 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (blastFlag <= 0 && s__state == 4368)) || (((s__state == 4512 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((blastFlag <= 4 && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4416 == s__state)) || (((s__state == 4528 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((blastFlag <= 4 && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state == 4480)) || (blastFlag <= 2 && 4384 == s__state)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((blastFlag <= 2 && 4464 == s__state) && s__hit == 0)) || ((blastFlag <= 2 && s__hit == 0) && 4416 == s__state)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || !(12292 <= \old(initial_state))) || (((s__state == 4432 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((4464 == s__state && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((blastFlag <= 2 && s__state == 4432) && s__hit == 0) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && 4560 <= s__state) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) || !(12292 <= \old(initial_state))) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 2) && s__hit == 0) && s__state <= 4560)) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: 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) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) && s__hit == 0)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 132 locations, 1 error locations. Result: SAFE, OverallTime: 23.1s, OverallIterations: 28, TraceHistogramMax: 21, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.0s, HoareTripleCheckerStatistics: 5657 SDtfs, 1964 SDslu, 3229 SDs, 0 SdLazy, 2642 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3017 GetRequests, 2972 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12568occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 7476 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 336 NumberOfFragments, 1153 HoareAnnotationTreeSize, 26 FomulaSimplifications, 32104 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 26 FomulaSimplificationsInter, 3841 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 9751 NumberOfCodeBlocks, 9751 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 9716 ConstructedInterpolants, 0 QuantifiedInterpolants, 5259474 SizeOfPredicates, 10 NumberOfNonLiveVariables, 4633 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 35 InterpolantComputations, 25 PerfectInterpolantSequences, 40521/40626 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...