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-112bae1 [2019-09-07 13:02:24,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:02:24,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:02:24,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:02:24,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:02:24,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:02:24,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:02:24,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:02:24,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:02:24,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:02:24,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:02:24,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:02:24,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:02:24,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:02:24,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:02:24,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:02:24,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:02:24,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:02:24,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:02:24,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:02:24,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:02:24,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:02:24,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:02:24,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:02:24,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:02:24,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:02:24,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:02:24,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:02:24,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:02:24,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:02:24,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:02:24,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:02:24,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:02:24,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:02:24,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:02:24,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:02:24,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:02:24,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:02:24,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:02:24,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:02:24,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:02:24,956 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-09-07 13:02:24,971 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:02:24,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:02:24,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:02:24,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:02:24,973 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:02:24,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:02:24,973 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:02:24,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:02:24,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:02:24,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:02:24,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:02:24,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:02:24,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:02:24,974 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:02:24,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:02:24,975 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:02:24,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:02:24,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:02:24,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:02:24,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:02:24,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:02:24,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:02:24,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:02:24,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:02:24,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:02:24,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:02:24,977 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:02:24,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:02:24,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:02:25,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:02:25,017 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:02:25,020 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:02:25,022 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:02:25,022 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:02:25,023 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-09-07 13:02:25,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90058ae57/bf743ac590284f78b0e3886aaaf864a0/FLAG2cdb49ef9 [2019-09-07 13:02:25,581 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:02:25,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-09-07 13:02:25,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90058ae57/bf743ac590284f78b0e3886aaaf864a0/FLAG2cdb49ef9 [2019-09-07 13:02:25,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90058ae57/bf743ac590284f78b0e3886aaaf864a0 [2019-09-07 13:02:25,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:02:25,905 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:02:25,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:02:25,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:02:25,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:02:25,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:02:25" (1/1) ... [2019-09-07 13:02:25,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41faf090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:25, skipping insertion in model container [2019-09-07 13:02:25,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:02:25" (1/1) ... [2019-09-07 13:02:25,921 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:02:25,982 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:02:26,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:02:26,213 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:02:26,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:02:26,379 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:02:26,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:26 WrapperNode [2019-09-07 13:02:26,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:02:26,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:02:26,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:02:26,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:02:26,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:26" (1/1) ... [2019-09-07 13:02:26,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:26" (1/1) ... [2019-09-07 13:02:26,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:26" (1/1) ... [2019-09-07 13:02:26,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:26" (1/1) ... [2019-09-07 13:02:26,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:26" (1/1) ... [2019-09-07 13:02:26,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:26" (1/1) ... [2019-09-07 13:02:26,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:26" (1/1) ... [2019-09-07 13:02:26,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:02:26,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:02:26,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:02:26,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:02:26,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:02:26,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:02:26,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:02:26,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-07 13:02:26,509 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:02:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:02:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:02:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-07 13:02:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:02:26,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:02:26,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:02:26,629 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:02:27,134 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-07 13:02:27,135 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-07 13:02:27,145 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:02:27,145 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:02:27,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:02:27 BoogieIcfgContainer [2019-09-07 13:02:27,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:02:27,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:02:27,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:02:27,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:02:27,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:02:25" (1/3) ... [2019-09-07 13:02:27,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6807edb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:02:27, skipping insertion in model container [2019-09-07 13:02:27,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:26" (2/3) ... [2019-09-07 13:02:27,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6807edb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:02:27, skipping insertion in model container [2019-09-07 13:02:27,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:02:27" (3/3) ... [2019-09-07 13:02:27,155 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-09-07 13:02:27,165 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:02:27,173 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:02:27,190 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:02:27,220 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:02:27,221 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:02:27,222 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:02:27,222 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:02:27,222 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:02:27,222 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:02:27,223 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:02:27,223 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:02:27,223 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:02:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2019-09-07 13:02:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 13:02:27,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:27,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:27,255 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:27,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:27,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2007307722, now seen corresponding path program 1 times [2019-09-07 13:02:27,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:27,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:27,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:27,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:27,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:02:27,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:27,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:27,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:27,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:27,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:27,466 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 3 states. [2019-09-07 13:02:27,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:27,610 INFO L93 Difference]: Finished difference Result 365 states and 622 transitions. [2019-09-07 13:02:27,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:27,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-07 13:02:27,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:27,636 INFO L225 Difference]: With dead ends: 365 [2019-09-07 13:02:27,636 INFO L226 Difference]: Without dead ends: 214 [2019-09-07 13:02:27,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-07 13:02:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-09-07 13:02:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-07 13:02:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 320 transitions. [2019-09-07 13:02:27,734 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 320 transitions. Word has length 29 [2019-09-07 13:02:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:27,735 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-09-07 13:02:27,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 320 transitions. [2019-09-07 13:02:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 13:02:27,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:27,738 INFO L399 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-09-07 13:02:27,739 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:27,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:27,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1381474291, now seen corresponding path program 1 times [2019-09-07 13:02:27,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:27,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:27,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:27,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:27,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:02:27,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:27,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:27,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:27,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:27,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:27,835 INFO L87 Difference]: Start difference. First operand 214 states and 320 transitions. Second operand 3 states. [2019-09-07 13:02:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:28,073 INFO L93 Difference]: Finished difference Result 460 states and 698 transitions. [2019-09-07 13:02:28,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:28,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-07 13:02:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:28,079 INFO L225 Difference]: With dead ends: 460 [2019-09-07 13:02:28,079 INFO L226 Difference]: Without dead ends: 258 [2019-09-07 13:02:28,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-07 13:02:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2019-09-07 13:02:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-07 13:02:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 364 transitions. [2019-09-07 13:02:28,115 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 364 transitions. Word has length 43 [2019-09-07 13:02:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:28,115 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 364 transitions. [2019-09-07 13:02:28,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 364 transitions. [2019-09-07 13:02:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 13:02:28,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:28,119 INFO L399 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-09-07 13:02:28,119 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:28,120 INFO L82 PathProgramCache]: Analyzing trace with hash 632602009, now seen corresponding path program 1 times [2019-09-07 13:02:28,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:28,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 13:02:28,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:28,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:28,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:28,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:28,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:28,187 INFO L87 Difference]: Start difference. First operand 248 states and 364 transitions. Second operand 3 states. [2019-09-07 13:02:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:28,409 INFO L93 Difference]: Finished difference Result 584 states and 888 transitions. [2019-09-07 13:02:28,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:28,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-07 13:02:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:28,412 INFO L225 Difference]: With dead ends: 584 [2019-09-07 13:02:28,413 INFO L226 Difference]: Without dead ends: 346 [2019-09-07 13:02:28,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-07 13:02:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 330. [2019-09-07 13:02:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-07 13:02:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 464 transitions. [2019-09-07 13:02:28,430 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 464 transitions. Word has length 60 [2019-09-07 13:02:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:28,431 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 464 transitions. [2019-09-07 13:02:28,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 464 transitions. [2019-09-07 13:02:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 13:02:28,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:28,434 INFO L399 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-09-07 13:02:28,434 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:28,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:28,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1172836325, now seen corresponding path program 1 times [2019-09-07 13:02:28,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:28,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:28,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:28,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 13:02:28,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:28,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:28,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:28,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:28,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:28,505 INFO L87 Difference]: Start difference. First operand 330 states and 464 transitions. Second operand 3 states. [2019-09-07 13:02:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:28,667 INFO L93 Difference]: Finished difference Result 694 states and 991 transitions. [2019-09-07 13:02:28,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:28,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-07 13:02:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:28,675 INFO L225 Difference]: With dead ends: 694 [2019-09-07 13:02:28,675 INFO L226 Difference]: Without dead ends: 376 [2019-09-07 13:02:28,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:28,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-07 13:02:28,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2019-09-07 13:02:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-07 13:02:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 512 transitions. [2019-09-07 13:02:28,699 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 512 transitions. Word has length 60 [2019-09-07 13:02:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:28,700 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 512 transitions. [2019-09-07 13:02:28,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 512 transitions. [2019-09-07 13:02:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 13:02:28,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:28,709 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:28,709 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:28,709 INFO L82 PathProgramCache]: Analyzing trace with hash 244907033, now seen corresponding path program 1 times [2019-09-07 13:02:28,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:28,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:28,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:28,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 13:02:28,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:28,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:28,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:28,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:28,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:28,806 INFO L87 Difference]: Start difference. First operand 368 states and 512 transitions. Second operand 3 states. [2019-09-07 13:02:28,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:28,997 INFO L93 Difference]: Finished difference Result 828 states and 1190 transitions. [2019-09-07 13:02:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:29,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-07 13:02:29,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:29,013 INFO L225 Difference]: With dead ends: 828 [2019-09-07 13:02:29,013 INFO L226 Difference]: Without dead ends: 470 [2019-09-07 13:02:29,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-07 13:02:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 446. [2019-09-07 13:02:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-09-07 13:02:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 646 transitions. [2019-09-07 13:02:29,030 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 646 transitions. Word has length 72 [2019-09-07 13:02:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:29,031 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 646 transitions. [2019-09-07 13:02:29,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 646 transitions. [2019-09-07 13:02:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 13:02:29,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:29,033 INFO L399 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-09-07 13:02:29,033 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:29,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:29,034 INFO L82 PathProgramCache]: Analyzing trace with hash -834546447, now seen corresponding path program 1 times [2019-09-07 13:02:29,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:29,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:29,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:29,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 13:02:29,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:29,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:29,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:29,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:29,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,079 INFO L87 Difference]: Start difference. First operand 446 states and 646 transitions. Second operand 3 states. [2019-09-07 13:02:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:29,216 INFO L93 Difference]: Finished difference Result 928 states and 1353 transitions. [2019-09-07 13:02:29,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:29,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-07 13:02:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:29,223 INFO L225 Difference]: With dead ends: 928 [2019-09-07 13:02:29,224 INFO L226 Difference]: Without dead ends: 494 [2019-09-07 13:02:29,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-07 13:02:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2019-09-07 13:02:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-07 13:02:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 698 transitions. [2019-09-07 13:02:29,245 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 698 transitions. Word has length 76 [2019-09-07 13:02:29,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:29,246 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 698 transitions. [2019-09-07 13:02:29,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 698 transitions. [2019-09-07 13:02:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 13:02:29,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:29,249 INFO L399 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-09-07 13:02:29,249 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:29,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:29,249 INFO L82 PathProgramCache]: Analyzing trace with hash -532111447, now seen corresponding path program 1 times [2019-09-07 13:02:29,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:29,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:29,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:29,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 13:02:29,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:29,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:29,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:29,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:29,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,322 INFO L87 Difference]: Start difference. First operand 488 states and 698 transitions. Second operand 3 states. [2019-09-07 13:02:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:29,371 INFO L93 Difference]: Finished difference Result 964 states and 1385 transitions. [2019-09-07 13:02:29,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:29,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-07 13:02:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:29,376 INFO L225 Difference]: With dead ends: 964 [2019-09-07 13:02:29,376 INFO L226 Difference]: Without dead ends: 725 [2019-09-07 13:02:29,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-09-07 13:02:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2019-09-07 13:02:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-09-07 13:02:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1038 transitions. [2019-09-07 13:02:29,398 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1038 transitions. Word has length 96 [2019-09-07 13:02:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:29,399 INFO L475 AbstractCegarLoop]: Abstraction has 725 states and 1038 transitions. [2019-09-07 13:02:29,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1038 transitions. [2019-09-07 13:02:29,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 13:02:29,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:29,406 INFO L399 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-09-07 13:02:29,406 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:29,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2130642131, now seen corresponding path program 1 times [2019-09-07 13:02:29,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:29,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:29,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:29,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-07 13:02:29,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:29,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:29,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:29,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:29,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,487 INFO L87 Difference]: Start difference. First operand 725 states and 1038 transitions. Second operand 3 states. [2019-09-07 13:02:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:29,527 INFO L93 Difference]: Finished difference Result 964 states and 1382 transitions. [2019-09-07 13:02:29,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:29,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-07 13:02:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:29,533 INFO L225 Difference]: With dead ends: 964 [2019-09-07 13:02:29,533 INFO L226 Difference]: Without dead ends: 962 [2019-09-07 13:02:29,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-09-07 13:02:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2019-09-07 13:02:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-09-07 13:02:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1380 transitions. [2019-09-07 13:02:29,560 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1380 transitions. Word has length 98 [2019-09-07 13:02:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:29,561 INFO L475 AbstractCegarLoop]: Abstraction has 962 states and 1380 transitions. [2019-09-07 13:02:29,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1380 transitions. [2019-09-07 13:02:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-07 13:02:29,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:29,564 INFO L399 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-09-07 13:02:29,564 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:29,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:29,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1135672730, now seen corresponding path program 1 times [2019-09-07 13:02:29,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:29,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:29,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:29,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 13:02:29,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:29,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:29,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:29,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:29,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,637 INFO L87 Difference]: Start difference. First operand 962 states and 1380 transitions. Second operand 3 states. [2019-09-07 13:02:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:29,831 INFO L93 Difference]: Finished difference Result 2112 states and 3080 transitions. [2019-09-07 13:02:29,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:29,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-07 13:02:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:29,838 INFO L225 Difference]: With dead ends: 2112 [2019-09-07 13:02:29,838 INFO L226 Difference]: Without dead ends: 1154 [2019-09-07 13:02:29,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-09-07 13:02:29,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1118. [2019-09-07 13:02:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-09-07 13:02:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1620 transitions. [2019-09-07 13:02:29,871 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1620 transitions. Word has length 152 [2019-09-07 13:02:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:29,872 INFO L475 AbstractCegarLoop]: Abstraction has 1118 states and 1620 transitions. [2019-09-07 13:02:29,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1620 transitions. [2019-09-07 13:02:29,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-07 13:02:29,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:29,876 INFO L399 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-09-07 13:02:29,876 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:29,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:29,877 INFO L82 PathProgramCache]: Analyzing trace with hash -862106901, now seen corresponding path program 1 times [2019-09-07 13:02:29,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:29,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:29,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:29,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-09-07 13:02:29,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:29,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:29,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:29,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:29,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,933 INFO L87 Difference]: Start difference. First operand 1118 states and 1620 transitions. Second operand 3 states. [2019-09-07 13:02:30,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:30,074 INFO L93 Difference]: Finished difference Result 2330 states and 3354 transitions. [2019-09-07 13:02:30,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:30,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-09-07 13:02:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:30,085 INFO L225 Difference]: With dead ends: 2330 [2019-09-07 13:02:30,085 INFO L226 Difference]: Without dead ends: 1224 [2019-09-07 13:02:30,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-09-07 13:02:30,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1210. [2019-09-07 13:02:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-09-07 13:02:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1732 transitions. [2019-09-07 13:02:30,144 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1732 transitions. Word has length 188 [2019-09-07 13:02:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:30,145 INFO L475 AbstractCegarLoop]: Abstraction has 1210 states and 1732 transitions. [2019-09-07 13:02:30,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1732 transitions. [2019-09-07 13:02:30,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-07 13:02:30,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:30,160 INFO L399 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-09-07 13:02:30,160 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:30,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:30,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2139251602, now seen corresponding path program 1 times [2019-09-07 13:02:30,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:30,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:30,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:30,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:30,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-07 13:02:30,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:30,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:30,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:30,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:30,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:30,321 INFO L87 Difference]: Start difference. First operand 1210 states and 1732 transitions. Second operand 3 states. [2019-09-07 13:02:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:30,523 INFO L93 Difference]: Finished difference Result 2520 states and 3596 transitions. [2019-09-07 13:02:30,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:30,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-09-07 13:02:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:30,534 INFO L225 Difference]: With dead ends: 2520 [2019-09-07 13:02:30,534 INFO L226 Difference]: Without dead ends: 1322 [2019-09-07 13:02:30,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-09-07 13:02:30,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1310. [2019-09-07 13:02:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-09-07 13:02:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1852 transitions. [2019-09-07 13:02:30,590 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1852 transitions. Word has length 209 [2019-09-07 13:02:30,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:30,591 INFO L475 AbstractCegarLoop]: Abstraction has 1310 states and 1852 transitions. [2019-09-07 13:02:30,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1852 transitions. [2019-09-07 13:02:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-07 13:02:30,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:30,597 INFO L399 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-09-07 13:02:30,597 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:30,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:30,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1924345883, now seen corresponding path program 1 times [2019-09-07 13:02:30,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:30,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:30,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:30,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:30,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-07 13:02:30,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:30,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:30,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:30,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:30,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:30,705 INFO L87 Difference]: Start difference. First operand 1310 states and 1852 transitions. Second operand 3 states. [2019-09-07 13:02:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:30,862 INFO L93 Difference]: Finished difference Result 2728 states and 3848 transitions. [2019-09-07 13:02:30,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:30,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-07 13:02:30,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:30,871 INFO L225 Difference]: With dead ends: 2728 [2019-09-07 13:02:30,871 INFO L226 Difference]: Without dead ends: 1430 [2019-09-07 13:02:30,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-09-07 13:02:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1422. [2019-09-07 13:02:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2019-09-07 13:02:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1984 transitions. [2019-09-07 13:02:30,919 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1984 transitions. Word has length 233 [2019-09-07 13:02:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:30,920 INFO L475 AbstractCegarLoop]: Abstraction has 1422 states and 1984 transitions. [2019-09-07 13:02:30,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1984 transitions. [2019-09-07 13:02:30,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-07 13:02:30,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:30,926 INFO L399 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-09-07 13:02:30,927 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:30,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:30,927 INFO L82 PathProgramCache]: Analyzing trace with hash -643476451, now seen corresponding path program 1 times [2019-09-07 13:02:30,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:30,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:30,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:30,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:30,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-07 13:02:31,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:31,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:31,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:31,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:31,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:31,032 INFO L87 Difference]: Start difference. First operand 1422 states and 1984 transitions. Second operand 3 states. [2019-09-07 13:02:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:31,189 INFO L93 Difference]: Finished difference Result 2968 states and 4148 transitions. [2019-09-07 13:02:31,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:31,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-07 13:02:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:31,198 INFO L225 Difference]: With dead ends: 2968 [2019-09-07 13:02:31,198 INFO L226 Difference]: Without dead ends: 1558 [2019-09-07 13:02:31,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-09-07 13:02:31,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1546. [2019-09-07 13:02:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-09-07 13:02:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2128 transitions. [2019-09-07 13:02:31,243 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2128 transitions. Word has length 233 [2019-09-07 13:02:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:31,244 INFO L475 AbstractCegarLoop]: Abstraction has 1546 states and 2128 transitions. [2019-09-07 13:02:31,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2128 transitions. [2019-09-07 13:02:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-07 13:02:31,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:31,250 INFO L399 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-09-07 13:02:31,250 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:31,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:31,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1388986723, now seen corresponding path program 1 times [2019-09-07 13:02:31,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:31,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:31,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:31,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:31,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-09-07 13:02:31,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:31,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:31,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:31,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:31,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:31,357 INFO L87 Difference]: Start difference. First operand 1546 states and 2128 transitions. Second operand 3 states. [2019-09-07 13:02:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:31,552 INFO L93 Difference]: Finished difference Result 3232 states and 4464 transitions. [2019-09-07 13:02:31,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:31,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-09-07 13:02:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:31,561 INFO L225 Difference]: With dead ends: 3232 [2019-09-07 13:02:31,561 INFO L226 Difference]: Without dead ends: 1698 [2019-09-07 13:02:31,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-07 13:02:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1690. [2019-09-07 13:02:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-09-07 13:02:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2292 transitions. [2019-09-07 13:02:31,608 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2292 transitions. Word has length 263 [2019-09-07 13:02:31,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:31,608 INFO L475 AbstractCegarLoop]: Abstraction has 1690 states and 2292 transitions. [2019-09-07 13:02:31,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2292 transitions. [2019-09-07 13:02:31,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-07 13:02:31,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:31,615 INFO L399 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-09-07 13:02:31,616 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:31,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:31,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1178835611, now seen corresponding path program 1 times [2019-09-07 13:02:31,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:31,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:31,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:31,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:31,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-09-07 13:02:31,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:31,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:31,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:31,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:31,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:31,697 INFO L87 Difference]: Start difference. First operand 1690 states and 2292 transitions. Second operand 3 states. [2019-09-07 13:02:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:31,747 INFO L93 Difference]: Finished difference Result 5038 states and 6836 transitions. [2019-09-07 13:02:31,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:31,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-09-07 13:02:31,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:31,765 INFO L225 Difference]: With dead ends: 5038 [2019-09-07 13:02:31,766 INFO L226 Difference]: Without dead ends: 3360 [2019-09-07 13:02:31,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2019-09-07 13:02:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3358. [2019-09-07 13:02:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3358 states. [2019-09-07 13:02:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4555 transitions. [2019-09-07 13:02:31,851 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4555 transitions. Word has length 263 [2019-09-07 13:02:31,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:31,852 INFO L475 AbstractCegarLoop]: Abstraction has 3358 states and 4555 transitions. [2019-09-07 13:02:31,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4555 transitions. [2019-09-07 13:02:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-07 13:02:31,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:31,862 INFO L399 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-09-07 13:02:31,862 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:31,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:31,862 INFO L82 PathProgramCache]: Analyzing trace with hash 554282629, now seen corresponding path program 1 times [2019-09-07 13:02:31,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:31,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:31,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:31,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:31,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-09-07 13:02:31,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:31,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:31,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:31,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:31,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:31,999 INFO L87 Difference]: Start difference. First operand 3358 states and 4555 transitions. Second operand 3 states. [2019-09-07 13:02:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:32,161 INFO L93 Difference]: Finished difference Result 6852 states and 9306 transitions. [2019-09-07 13:02:32,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:32,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-09-07 13:02:32,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:32,178 INFO L225 Difference]: With dead ends: 6852 [2019-09-07 13:02:32,178 INFO L226 Difference]: Without dead ends: 3506 [2019-09-07 13:02:32,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2019-09-07 13:02:32,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3490. [2019-09-07 13:02:32,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-09-07 13:02:32,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4707 transitions. [2019-09-07 13:02:32,274 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4707 transitions. Word has length 287 [2019-09-07 13:02:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:32,274 INFO L475 AbstractCegarLoop]: Abstraction has 3490 states and 4707 transitions. [2019-09-07 13:02:32,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4707 transitions. [2019-09-07 13:02:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-07 13:02:32,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:32,284 INFO L399 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-09-07 13:02:32,284 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:32,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1163110431, now seen corresponding path program 1 times [2019-09-07 13:02:32,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:32,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:32,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 541 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-07 13:02:32,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:32,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:32,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:32,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:32,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:32,369 INFO L87 Difference]: Start difference. First operand 3490 states and 4707 transitions. Second operand 3 states. [2019-09-07 13:02:32,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:32,548 INFO L93 Difference]: Finished difference Result 7360 states and 10062 transitions. [2019-09-07 13:02:32,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:32,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-09-07 13:02:32,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:32,569 INFO L225 Difference]: With dead ends: 7360 [2019-09-07 13:02:32,570 INFO L226 Difference]: Without dead ends: 3882 [2019-09-07 13:02:32,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2019-09-07 13:02:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3802. [2019-09-07 13:02:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3802 states. [2019-09-07 13:02:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 5075 transitions. [2019-09-07 13:02:32,735 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 5075 transitions. Word has length 298 [2019-09-07 13:02:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:32,736 INFO L475 AbstractCegarLoop]: Abstraction has 3802 states and 5075 transitions. [2019-09-07 13:02:32,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 5075 transitions. [2019-09-07 13:02:32,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-07 13:02:32,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:32,749 INFO L399 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-09-07 13:02:32,750 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:32,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:32,750 INFO L82 PathProgramCache]: Analyzing trace with hash -121210371, now seen corresponding path program 1 times [2019-09-07 13:02:32,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:32,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:32,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:32,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:32,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-09-07 13:02:32,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:32,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:32,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:32,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:32,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:32,845 INFO L87 Difference]: Start difference. First operand 3802 states and 5075 transitions. Second operand 3 states. [2019-09-07 13:02:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:33,039 INFO L93 Difference]: Finished difference Result 7992 states and 10606 transitions. [2019-09-07 13:02:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:33,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-07 13:02:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:33,068 INFO L225 Difference]: With dead ends: 7992 [2019-09-07 13:02:33,068 INFO L226 Difference]: Without dead ends: 4202 [2019-09-07 13:02:33,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2019-09-07 13:02:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 3922. [2019-09-07 13:02:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3922 states. [2019-09-07 13:02:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 5219 transitions. [2019-09-07 13:02:33,168 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 5219 transitions. Word has length 311 [2019-09-07 13:02:33,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:33,169 INFO L475 AbstractCegarLoop]: Abstraction has 3922 states and 5219 transitions. [2019-09-07 13:02:33,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:33,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 5219 transitions. [2019-09-07 13:02:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-07 13:02:33,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:33,180 INFO L399 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-09-07 13:02:33,181 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:33,181 INFO L82 PathProgramCache]: Analyzing trace with hash -828607418, now seen corresponding path program 1 times [2019-09-07 13:02:33,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:33,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:33,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:33,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:33,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 706 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-09-07 13:02:33,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:33,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:33,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:33,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:33,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:33,382 INFO L87 Difference]: Start difference. First operand 3922 states and 5219 transitions. Second operand 3 states. [2019-09-07 13:02:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:33,457 INFO L93 Difference]: Finished difference Result 11238 states and 15033 transitions. [2019-09-07 13:02:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:33,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-07 13:02:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:33,473 INFO L225 Difference]: With dead ends: 11238 [2019-09-07 13:02:33,473 INFO L226 Difference]: Without dead ends: 7328 [2019-09-07 13:02:33,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7328 states. [2019-09-07 13:02:33,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7328 to 7326. [2019-09-07 13:02:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7326 states. [2019-09-07 13:02:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 9805 transitions. [2019-09-07 13:02:33,617 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 9805 transitions. Word has length 312 [2019-09-07 13:02:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:33,617 INFO L475 AbstractCegarLoop]: Abstraction has 7326 states and 9805 transitions. [2019-09-07 13:02:33,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 9805 transitions. [2019-09-07 13:02:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-07 13:02:33,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:33,631 INFO L399 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-09-07 13:02:33,632 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash -935849662, now seen corresponding path program 1 times [2019-09-07 13:02:33,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:33,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:33,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:33,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:33,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 710 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-09-07 13:02:33,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:33,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:33,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:33,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:33,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:33,721 INFO L87 Difference]: Start difference. First operand 7326 states and 9805 transitions. Second operand 3 states. [2019-09-07 13:02:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:33,918 INFO L93 Difference]: Finished difference Result 14648 states and 19586 transitions. [2019-09-07 13:02:33,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:33,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-09-07 13:02:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:33,935 INFO L225 Difference]: With dead ends: 14648 [2019-09-07 13:02:33,935 INFO L226 Difference]: Without dead ends: 7334 [2019-09-07 13:02:33,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7334 states. [2019-09-07 13:02:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7334 to 7302. [2019-09-07 13:02:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7302 states. [2019-09-07 13:02:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 9525 transitions. [2019-09-07 13:02:34,147 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 9525 transitions. Word has length 313 [2019-09-07 13:02:34,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:34,147 INFO L475 AbstractCegarLoop]: Abstraction has 7302 states and 9525 transitions. [2019-09-07 13:02:34,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 9525 transitions. [2019-09-07 13:02:34,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-07 13:02:34,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:34,162 INFO L399 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-09-07 13:02:34,163 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:34,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:34,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1555626477, now seen corresponding path program 1 times [2019-09-07 13:02:34,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:34,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:34,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:34,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:34,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 765 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-07 13:02:34,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:02:34,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:02:34,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:34,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 13:02:34,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:02:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2019-09-07 13:02:34,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:02:34,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 13:02:34,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:02:34,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:02:34,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:02:34,643 INFO L87 Difference]: Start difference. First operand 7302 states and 9525 transitions. Second operand 5 states. [2019-09-07 13:02:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:35,772 INFO L93 Difference]: Finished difference Result 23668 states and 30845 transitions. [2019-09-07 13:02:35,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:02:35,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 336 [2019-09-07 13:02:35,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:35,820 INFO L225 Difference]: With dead ends: 23668 [2019-09-07 13:02:35,821 INFO L226 Difference]: Without dead ends: 16366 [2019-09-07 13:02:35,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:02:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16366 states. [2019-09-07 13:02:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16366 to 12562. [2019-09-07 13:02:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12562 states. [2019-09-07 13:02:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12562 states to 12562 states and 16449 transitions. [2019-09-07 13:02:36,349 INFO L78 Accepts]: Start accepts. Automaton has 12562 states and 16449 transitions. Word has length 336 [2019-09-07 13:02:36,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:36,350 INFO L475 AbstractCegarLoop]: Abstraction has 12562 states and 16449 transitions. [2019-09-07 13:02:36,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:02:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 12562 states and 16449 transitions. [2019-09-07 13:02:36,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-07 13:02:36,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:36,380 INFO L399 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-09-07 13:02:36,380 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:36,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:36,380 INFO L82 PathProgramCache]: Analyzing trace with hash 784866133, now seen corresponding path program 1 times [2019-09-07 13:02:36,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:36,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:36,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:36,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:36,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 806 proven. 5 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-09-07 13:02:37,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:02:37,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:02:37,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:37,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:02:37,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:02:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-09-07 13:02:37,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:02:37,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 13:02:37,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:02:37,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:02:37,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:02:37,496 INFO L87 Difference]: Start difference. First operand 12562 states and 16449 transitions. Second operand 5 states. [2019-09-07 13:02:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:38,044 INFO L93 Difference]: Finished difference Result 27580 states and 35156 transitions. [2019-09-07 13:02:38,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:02:38,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 350 [2019-09-07 13:02:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:38,079 INFO L225 Difference]: With dead ends: 27580 [2019-09-07 13:02:38,079 INFO L226 Difference]: Without dead ends: 15018 [2019-09-07 13:02:38,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:02:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15018 states. [2019-09-07 13:02:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15018 to 11732. [2019-09-07 13:02:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11732 states. [2019-09-07 13:02:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11732 states to 11732 states and 14651 transitions. [2019-09-07 13:02:38,389 INFO L78 Accepts]: Start accepts. Automaton has 11732 states and 14651 transitions. Word has length 350 [2019-09-07 13:02:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:38,390 INFO L475 AbstractCegarLoop]: Abstraction has 11732 states and 14651 transitions. [2019-09-07 13:02:38,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:02:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 11732 states and 14651 transitions. [2019-09-07 13:02:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-07 13:02:38,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:38,413 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:38,413 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:38,414 INFO L82 PathProgramCache]: Analyzing trace with hash 442351124, now seen corresponding path program 1 times [2019-09-07 13:02:38,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:38,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:38,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:38,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:38,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 849 proven. 0 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2019-09-07 13:02:38,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:38,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:38,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:38,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:38,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:38,664 INFO L87 Difference]: Start difference. First operand 11732 states and 14651 transitions. Second operand 3 states. [2019-09-07 13:02:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:38,893 INFO L93 Difference]: Finished difference Result 22662 states and 27774 transitions. [2019-09-07 13:02:38,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:38,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-09-07 13:02:38,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:38,903 INFO L225 Difference]: With dead ends: 22662 [2019-09-07 13:02:38,903 INFO L226 Difference]: Without dead ends: 5464 [2019-09-07 13:02:38,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2019-09-07 13:02:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 5231. [2019-09-07 13:02:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5231 states. [2019-09-07 13:02:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 6480 transitions. [2019-09-07 13:02:39,008 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 6480 transitions. Word has length 403 [2019-09-07 13:02:39,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:39,009 INFO L475 AbstractCegarLoop]: Abstraction has 5231 states and 6480 transitions. [2019-09-07 13:02:39,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 6480 transitions. [2019-09-07 13:02:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-07 13:02:39,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:39,021 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 17, 17, 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] [2019-09-07 13:02:39,021 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:39,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:39,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1725985204, now seen corresponding path program 1 times [2019-09-07 13:02:39,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:39,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:39,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:39,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:39,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2623 backedges. 1505 proven. 14 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-07 13:02:39,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:02:39,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:02:39,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:39,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:02:39,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:02:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2623 backedges. 939 proven. 0 refuted. 0 times theorem prover too weak. 1684 trivial. 0 not checked. [2019-09-07 13:02:39,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:02:39,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 13:02:39,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:02:39,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:02:39,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:02:39,637 INFO L87 Difference]: Start difference. First operand 5231 states and 6480 transitions. Second operand 5 states. [2019-09-07 13:02:39,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:39,905 INFO L93 Difference]: Finished difference Result 6747 states and 8358 transitions. [2019-09-07 13:02:39,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:02:39,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 487 [2019-09-07 13:02:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:39,906 INFO L225 Difference]: With dead ends: 6747 [2019-09-07 13:02:39,906 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 13:02:39,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:02:39,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 13:02:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 13:02:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 13:02:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 13:02:39,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 487 [2019-09-07 13:02:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:39,915 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 13:02:39,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:02:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 13:02:39,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 13:02:39,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 13:02:41,008 WARN L188 SmtUtils]: Spent 990.00 ms on a formula simplification. DAG size of input: 639 DAG size of output: 127 [2019-09-07 13:02:41,631 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 27 [2019-09-07 13:02:42,740 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-07 13:02:43,027 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 25 [2019-09-07 13:02:43,332 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 24 [2019-09-07 13:02:43,644 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-09-07 13:02:43,771 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-09-07 13:02:43,773 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-07 13:02:43,773 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:02:43,773 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed. [2019-09-07 13:02:43,773 INFO L443 ceAbstractionStarter]: For program point L366-2(lines 366 370) no Hoare annotation was computed. [2019-09-07 13:02:43,774 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 593) no Hoare annotation was computed. [2019-09-07 13:02:43,774 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 540) no Hoare annotation was computed. [2019-09-07 13:02:43,774 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 551) no Hoare annotation was computed. [2019-09-07 13:02:43,774 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 562) no Hoare annotation was computed. [2019-09-07 13:02:43,774 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 590) no Hoare annotation was computed. [2019-09-07 13:02:43,774 INFO L443 ceAbstractionStarter]: For program point L500-1(lines 198 528) no Hoare annotation was computed. [2019-09-07 13:02:43,774 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 340) no Hoare annotation was computed. [2019-09-07 13:02:43,774 INFO L443 ceAbstractionStarter]: For program point L302-1(lines 302 316) no Hoare annotation was computed. [2019-09-07 13:02:43,774 INFO L439 ceAbstractionStarter]: At program point L203(lines 100 563) the Hoare annotation is: (<= ssl3_connect_~blastFlag~0 0) [2019-09-07 13:02:43,775 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 (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 0) .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-09-07 13:02:43,775 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-09-07 13:02:43,775 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 576) no Hoare annotation was computed. [2019-09-07 13:02:43,775 INFO L443 ceAbstractionStarter]: For program point L600-2(lines 600 604) no Hoare annotation was computed. [2019-09-07 13:02:43,775 INFO L443 ceAbstractionStarter]: For program point L567-2(lines 566 588) no Hoare annotation was computed. [2019-09-07 13:02:43,775 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-09-07 13:02:43,775 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-09-07 13:02:43,776 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 539) no Hoare annotation was computed. [2019-09-07 13:02:43,776 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 550) no Hoare annotation was computed. [2019-09-07 13:02:43,776 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 561) no Hoare annotation was computed. [2019-09-07 13:02:43,776 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 573) no Hoare annotation was computed. [2019-09-07 13:02:43,776 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 442) no Hoare annotation was computed. [2019-09-07 13:02:43,776 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__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)))) [2019-09-07 13:02:43,776 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-09-07 13:02:43,777 INFO L443 ceAbstractionStarter]: For program point L471(lines 471 475) no Hoare annotation was computed. [2019-09-07 13:02:43,777 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-09-07 13:02:43,777 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 304 316) no Hoare annotation was computed. [2019-09-07 13:02:43,777 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 505 509) no Hoare annotation was computed. [2019-09-07 13:02:43,777 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 410) no Hoare annotation was computed. [2019-09-07 13:02:43,777 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 212) no Hoare annotation was computed. [2019-09-07 13:02:43,777 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 538) no Hoare annotation was computed. [2019-09-07 13:02:43,777 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 549) no Hoare annotation was computed. [2019-09-07 13:02:43,777 INFO L443 ceAbstractionStarter]: For program point L208-2(lines 198 528) no Hoare annotation was computed. [2019-09-07 13:02:43,778 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 560) no Hoare annotation was computed. [2019-09-07 13:02:43,778 INFO L439 ceAbstractionStarter]: At program point L176(lines 172 539) 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 (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-09-07 13:02:43,778 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-09-07 13:02:43,778 INFO L443 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-09-07 13:02:43,778 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 249) no Hoare annotation was computed. [2019-09-07 13:02:43,778 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 537) no Hoare annotation was computed. [2019-09-07 13:02:43,778 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 548) no Hoare annotation was computed. [2019-09-07 13:02:43,779 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 559) no Hoare annotation was computed. [2019-09-07 13:02:43,779 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-09-07 13:02:43,779 INFO L443 ceAbstractionStarter]: For program point L476-2(lines 476 480) no Hoare annotation was computed. [2019-09-07 13:02:43,779 INFO L439 ceAbstractionStarter]: At program point L146(lines 142 549) 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_~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 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3))) [2019-09-07 13:02:43,779 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 382) no Hoare annotation was computed. [2019-09-07 13:02:43,779 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-09-07 13:02:43,779 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 287) no Hoare annotation was computed. [2019-09-07 13:02:43,780 INFO L439 ceAbstractionStarter]: At program point L346(lines 60 608) the Hoare annotation is: false [2019-09-07 13:02:43,780 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 536) no Hoare annotation was computed. [2019-09-07 13:02:43,780 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 547) no Hoare annotation was computed. [2019-09-07 13:02:43,780 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 558) no Hoare annotation was computed. [2019-09-07 13:02:43,780 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 584) no Hoare annotation was computed. [2019-09-07 13:02:43,780 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-09-07 13:02:43,780 INFO L443 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-09-07 13:02:43,780 INFO L439 ceAbstractionStarter]: At program point L182(lines 178 537) 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_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3))) [2019-09-07 13:02:43,780 INFO L439 ceAbstractionStarter]: At program point L116(lines 112 559) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560)) [2019-09-07 13:02:43,780 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-09-07 13:02:43,780 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-09-07 13:02:43,781 INFO L443 ceAbstractionStarter]: For program point L282-2(lines 198 528) no Hoare annotation was computed. [2019-09-07 13:02:43,781 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-09-07 13:02:43,781 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 7 609) the Hoare annotation is: true [2019-09-07 13:02:43,781 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 535) no Hoare annotation was computed. [2019-09-07 13:02:43,781 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 546) no Hoare annotation was computed. [2019-09-07 13:02:43,781 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 557) no Hoare annotation was computed. [2019-09-07 13:02:43,781 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-09-07 13:02:43,781 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 354) no Hoare annotation was computed. [2019-09-07 13:02:43,781 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 484 496) no Hoare annotation was computed. [2019-09-07 13:02:43,781 INFO L443 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-09-07 13:02:43,781 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 237) no Hoare annotation was computed. [2019-09-07 13:02:43,781 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 534) no Hoare annotation was computed. [2019-09-07 13:02:43,781 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 545) no Hoare annotation was computed. [2019-09-07 13:02:43,781 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 198 528) no Hoare annotation was computed. [2019-09-07 13:02:43,782 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 556) no Hoare annotation was computed. [2019-09-07 13:02:43,782 INFO L439 ceAbstractionStarter]: At program point L188(lines 184 535) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__hit~0 0)) (.cse3 (<= ssl3_connect_~s__state~0 4560)) (.cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (<= 4560 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 (not .cse5)) (and .cse1 .cse2 .cse5 .cse3 .cse4 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-09-07 13:02:43,782 INFO L439 ceAbstractionStarter]: At program point L122(lines 118 557) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560)) [2019-09-07 13:02:43,782 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-09-07 13:02:43,782 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 227) no Hoare annotation was computed. [2019-09-07 13:02:43,782 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 492) no Hoare annotation was computed. [2019-09-07 13:02:43,782 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 465) no Hoare annotation was computed. [2019-09-07 13:02:43,782 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 454 465) no Hoare annotation was computed. [2019-09-07 13:02:43,782 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 533) no Hoare annotation was computed. [2019-09-07 13:02:43,782 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 544) no Hoare annotation was computed. [2019-09-07 13:02:43,782 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 555) no Hoare annotation was computed. [2019-09-07 13:02:43,783 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 393) no Hoare annotation was computed. [2019-09-07 13:02:43,783 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-09-07 13:02:43,783 INFO L443 ceAbstractionStarter]: For program point L323-2(lines 198 528) no Hoare annotation was computed. [2019-09-07 13:02:43,783 INFO L439 ceAbstractionStarter]: At program point L191(lines 190 533) the Hoare annotation is: (let ((.cse5 (<= ssl3_connect_~blastFlag~0 2)) (.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and .cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 (not .cse3)) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ssl3_connect_~blastFlag~0 0) .cse1 .cse2))) [2019-09-07 13:02:43,783 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__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) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3))) [2019-09-07 13:02:43,784 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 7 609) no Hoare annotation was computed. [2019-09-07 13:02:43,784 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 462) no Hoare annotation was computed. [2019-09-07 13:02:43,784 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 262) no Hoare annotation was computed. [2019-09-07 13:02:43,784 INFO L443 ceAbstractionStarter]: For program point L258-2(lines 198 528) no Hoare annotation was computed. [2019-09-07 13:02:43,784 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 7 609) no Hoare annotation was computed. [2019-09-07 13:02:43,784 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 532) no Hoare annotation was computed. [2019-09-07 13:02:43,784 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 543) no Hoare annotation was computed. [2019-09-07 13:02:43,785 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 554) no Hoare annotation was computed. [2019-09-07 13:02:43,785 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 60 608) no Hoare annotation was computed. [2019-09-07 13:02:43,785 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-09-07 13:02:43,785 INFO L443 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-09-07 13:02:43,785 INFO L446 ceAbstractionStarter]: At program point L194(lines 193 532) the Hoare annotation is: true [2019-09-07 13:02:43,785 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 (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse2) (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)))) [2019-09-07 13:02:43,785 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-09-07 13:02:43,785 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-09-07 13:02:43,786 INFO L443 ceAbstractionStarter]: For program point L426-2(lines 198 528) no Hoare annotation was computed. [2019-09-07 13:02:43,786 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 233) no Hoare annotation was computed. [2019-09-07 13:02:43,786 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-09-07 13:02:43,786 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 542) no Hoare annotation was computed. [2019-09-07 13:02:43,786 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 553) no Hoare annotation was computed. [2019-09-07 13:02:43,786 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 564) no Hoare annotation was computed. [2019-09-07 13:02:43,786 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 400) no Hoare annotation was computed. [2019-09-07 13:02:43,786 INFO L443 ceAbstractionStarter]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2019-09-07 13:02:43,786 INFO L446 ceAbstractionStarter]: At program point L197(lines 196 531) the Hoare annotation is: true [2019-09-07 13:02:43,787 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 (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 0) .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-09-07 13:02:43,787 INFO L439 ceAbstractionStarter]: At program point L98(lines 97 564) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 0) (<= 4560 ssl3_connect_~s__state~0)) [2019-09-07 13:02:43,787 INFO L439 ceAbstractionStarter]: At program point L529(lines 94 595) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0))) (let ((.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse19 (= 4416 ssl3_connect_~s__state~0)) (.cse15 (= ssl3_connect_~s__state~0 4432)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse18 (= 4464 ssl3_connect_~s__state~0)) (.cse8 (= ssl3_connect_~s__state~0 4512)) (.cse17 (= 4448 ssl3_connect_~s__state~0)) (.cse12 (<= 4560 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= 4352 ssl3_connect_~s__state~0)) (.cse14 (not .cse2)) (.cse1 (<= ssl3_connect_~blastFlag~0 4)) (.cse20 (= 4400 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse0 (= ssl3_connect_~s__state~0 4496)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse16 (<= ssl3_connect_~s__state~0 3)) (.cse10 (<= ssl3_connect_~blastFlag~0 2))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse2 .cse7 .cse3) (and .cse4 .cse8 .cse2 .cse3) (and .cse4 .cse2 .cse3 .cse9) (and .cse10 .cse11) (and .cse10 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse2 .cse3) (and .cse16 .cse4 .cse3) (and .cse4 .cse2 .cse17 .cse3) (and .cse18 .cse1 .cse2 .cse3) (and .cse10 .cse2 .cse9) (<= ssl3_connect_~blastFlag~0 0) (and .cse8 .cse1 .cse2 .cse3) (and .cse10 .cse2 .cse19) (and .cse11 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3 .cse9) (and .cse16 .cse10 .cse4) (and .cse4 .cse12 .cse2 .cse13 .cse7 .cse3) (and .cse1 .cse2 .cse3 .cse19) (and .cse10 .cse4 .cse5 .cse6 .cse2 .cse7) (and .cse10 .cse0 .cse2) (and .cse10 .cse15 .cse2) (and .cse1 .cse2 .cse17 .cse3) (and .cse4 .cse11 .cse2 .cse3) (and .cse10 .cse18 .cse2) (and .cse4 .cse18 .cse2 .cse3) (and .cse10 .cse8) (and .cse10 .cse20 .cse2) (and .cse10 .cse2 .cse17) (and .cse10 .cse4 .cse12 .cse13 .cse7) (and .cse10 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse5 .cse6 .cse14) (and .cse4 .cse1 .cse20 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse16 .cse10 .cse2) (and .cse10 (= 4384 ssl3_connect_~s__state~0))))) [2019-09-07 13:02:43,787 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 541) no Hoare annotation was computed. [2019-09-07 13:02:43,787 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 552) no Hoare annotation was computed. [2019-09-07 13:02:43,788 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 563) no Hoare annotation was computed. [2019-09-07 13:02:43,788 INFO L446 ceAbstractionStarter]: At program point L596(lines 93 597) the Hoare annotation is: true [2019-09-07 13:02:43,788 INFO L439 ceAbstractionStarter]: At program point L134(lines 130 553) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)))) [2019-09-07 13:02:43,788 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:02:43,788 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-07 13:02:43,788 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:02:43,788 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:02:43,788 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 610 620) the Hoare annotation is: true [2019-09-07 13:02:43,789 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 610 620) no Hoare annotation was computed. [2019-09-07 13:02:43,789 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 610 620) no Hoare annotation was computed. [2019-09-07 13:02:43,789 INFO L446 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: true [2019-09-07 13:02:43,789 INFO L443 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2019-09-07 13:02:43,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 01:02:43 BoogieIcfgContainer [2019-09-07 13:02:43,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 13:02:43,835 INFO L168 Benchmark]: Toolchain (without parser) took 17928.97 ms. Allocated memory was 132.6 MB in the beginning and 959.4 MB in the end (delta: 826.8 MB). Free memory was 88.2 MB in the beginning and 567.1 MB in the end (delta: -478.9 MB). Peak memory consumption was 799.7 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:43,835 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 13:02:43,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.68 ms. Allocated memory was 132.6 MB in the beginning and 200.8 MB in the end (delta: 68.2 MB). Free memory was 88.0 MB in the beginning and 175.0 MB in the end (delta: -87.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:43,841 INFO L168 Benchmark]: Boogie Preprocessor took 72.61 ms. Allocated memory is still 200.8 MB. Free memory was 175.0 MB in the beginning and 172.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:43,842 INFO L168 Benchmark]: RCFGBuilder took 693.12 ms. Allocated memory is still 200.8 MB. Free memory was 172.4 MB in the beginning and 131.9 MB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:43,842 INFO L168 Benchmark]: TraceAbstraction took 16685.31 ms. Allocated memory was 200.8 MB in the beginning and 959.4 MB in the end (delta: 758.6 MB). Free memory was 131.9 MB in the beginning and 567.1 MB in the end (delta: -435.2 MB). Peak memory consumption was 775.2 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:43,852 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 473.68 ms. Allocated memory was 132.6 MB in the beginning and 200.8 MB in the end (delta: 68.2 MB). Free memory was 88.0 MB in the beginning and 175.0 MB in the end (delta: -87.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.61 ms. Allocated memory is still 200.8 MB. Free memory was 175.0 MB in the beginning and 172.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 693.12 ms. Allocated memory is still 200.8 MB. Free memory was 172.4 MB in the beginning and 131.9 MB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16685.31 ms. Allocated memory was 200.8 MB in the beginning and 959.4 MB in the end (delta: 758.6 MB). Free memory was 131.9 MB in the beginning and 567.1 MB in the end (delta: -435.2 MB). Peak memory consumption was 775.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: ((((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) && s__hit == 0) || ((4432 <= s__state && blastFlag <= 0) && 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: 178]: Loop Invariant Derived loop invariant: (((4432 <= s__state && blastFlag <= 2) && 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__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || (((((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) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((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 <= 0) && 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: 100]: Loop Invariant Derived loop invariant: blastFlag <= 0 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((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 <= 0) && 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: 193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: blastFlag <= 0 && 4560 <= s__state - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((s__state == 4496 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 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)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0) && (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)) || (blastFlag <= 2 && s__state == 4528)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || (((s__state == 4432 && 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)) || (((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state) && (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__hit == 0) && s__state == 4480)) || blastFlag <= 0) || (((s__state == 4512 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((blastFlag <= 2 && s__hit == 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)) || ((s__state <= 3 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 4560)) || (((((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 <= 4 && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4416 == s__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)) || ((blastFlag <= 2 && s__state == 4496) && s__hit == 0)) || ((blastFlag <= 2 && s__state == 4432) && s__hit == 0)) || (((blastFlag <= 4 && s__hit == 0) && 4448 == s__state) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 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 && 4464 == s__state) && 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)) || (blastFlag <= 2 && s__state == 4512)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || ((blastFlag <= 2 && s__hit == 0) && 4448 == s__state)) || ((((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 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && 4400 == s__state) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || (blastFlag <= 2 && 4384 == s__state) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((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))) || (((((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 <= 0 && 4560 <= s__state) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: (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__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: 112]: Loop Invariant Derived loop invariant: (blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560 - InvariantResult [Line: 148]: 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) || (((4432 <= s__state && blastFlag <= 2) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && 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: 190]: 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__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 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 <= 0 && s__state <= 4352) && 4352 <= s__state) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) && s__hit == 0) || ((((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 <= 0) && s__state <= 4560)) || ((((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. SAFE Result, 16.5s OverallTime, 24 OverallIterations, 18 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 3.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 5283 SDtfs, 1692 SDslu, 3781 SDs, 0 SdLazy, 2981 SolverSat, 450 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1261 GetRequests, 1223 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12562occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 7889 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 393 NumberOfFragments, 1163 HoareAnnotationTreeSize, 26 FomulaSimplifications, 29368 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2701 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 6345 NumberOfCodeBlocks, 6345 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6318 ConstructedInterpolants, 0 QuantifiedInterpolants, 3389260 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1883 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 23490/23521 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...