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_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:02:24,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:02:24,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:02:24,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:02:24,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:02:24,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:02:24,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:02:24,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:02:24,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:02:24,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:02:24,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:02:24,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:02:24,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:02:24,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:02:24,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:02:24,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:02:24,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:02:24,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:02:24,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:02:24,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:02:24,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:02:24,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:02:24,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:02:24,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:02:24,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:02:24,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:02:24,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:02:24,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:02:24,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:02:24,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:02:24,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:02:24,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:02:24,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:02:24,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:02:24,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:02:24,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:02:24,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:02:24,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:02:24,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:02:24,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:02:24,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:02:24,518 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,540 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:02:24,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:02:24,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:02:24,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:02:24,542 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:02:24,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:02:24,543 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:02:24,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:02:24,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:02:24,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:02:24,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:02:24,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:02:24,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:02:24,546 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:02:24,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:02:24,546 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:02:24,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:02:24,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:02:24,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:02:24,547 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:02:24,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:02:24,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:02:24,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:02:24,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:02:24,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:02:24,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:02:24,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:02:24,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:02:24,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:02:24,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:02:24,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:02:24,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:02:24,621 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:02:24,621 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:02:24,621 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-09-07 13:02:24,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f190c712/1a2f0893b19d4729929fc35ed330a6e7/FLAG7d8866575 [2019-09-07 13:02:25,167 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:02:25,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-09-07 13:02:25,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f190c712/1a2f0893b19d4729929fc35ed330a6e7/FLAG7d8866575 [2019-09-07 13:02:25,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f190c712/1a2f0893b19d4729929fc35ed330a6e7 [2019-09-07 13:02:25,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:02:25,503 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:02:25,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:02:25,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:02:25,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:02:25,509 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,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6876a771 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,512 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,518 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:02:25,562 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:02:25,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:02:25,807 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:02:25,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:02:25,962 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:02:25,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:25 WrapperNode [2019-09-07 13:02:25,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:02:25,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:02:25,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:02:25,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:02:25,973 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:25" (1/1) ... [2019-09-07 13:02:25,974 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:25" (1/1) ... [2019-09-07 13:02:25,982 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:25" (1/1) ... [2019-09-07 13:02:25,982 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:25" (1/1) ... [2019-09-07 13:02:25,994 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:25" (1/1) ... [2019-09-07 13:02:26,006 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:25" (1/1) ... [2019-09-07 13:02:26,009 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:25" (1/1) ... [2019-09-07 13:02:26,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:02:26,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:02:26,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:02:26,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:02:26,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:02:26,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:02:26,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:02:26,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-07 13:02:26,082 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:02:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:02:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-07 13:02:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:02:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-07 13:02:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-07 13:02:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-07 13:02:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:02:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:02:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:02:26,217 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:02:26,697 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-07 13:02:26,698 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-07 13:02:26,709 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:02:26,709 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:02:26,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:02:26 BoogieIcfgContainer [2019-09-07 13:02:26,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:02:26,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:02:26,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:02:26,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:02:26,716 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:26,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5454df16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:02:26, skipping insertion in model container [2019-09-07 13:02:26,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:25" (2/3) ... [2019-09-07 13:02:26,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5454df16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:02:26, skipping insertion in model container [2019-09-07 13:02:26,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:02:26" (3/3) ... [2019-09-07 13:02:26,719 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2019-09-07 13:02:26,729 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:02:26,738 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:02:26,755 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:02:26,788 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:02:26,789 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:02:26,789 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:02:26,789 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:02:26,790 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:02:26,790 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:02:26,790 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:02:26,790 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:02:26,791 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:02:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-09-07 13:02:26,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 13:02:26,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:26,824 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:26,826 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:26,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:26,832 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-09-07 13:02:26,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:26,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:26,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:26,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:26,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:27,078 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,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:27,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:27,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:27,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:27,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:27,104 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-09-07 13:02:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:27,256 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-09-07 13:02:27,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:27,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-07 13:02:27,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:27,275 INFO L225 Difference]: With dead ends: 377 [2019-09-07 13:02:27,275 INFO L226 Difference]: Without dead ends: 220 [2019-09-07 13:02:27,279 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,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-07 13:02:27,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-09-07 13:02:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-07 13:02:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-09-07 13:02:27,350 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-09-07 13:02:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:27,351 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-09-07 13:02:27,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-09-07 13:02:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 13:02:27,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:27,355 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,355 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:27,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:27,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1426924635, now seen corresponding path program 1 times [2019-09-07 13:02:27,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:27,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:27,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:27,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:27,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:27,458 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,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:27,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:27,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:27,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:27,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:27,462 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-09-07 13:02:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:27,657 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2019-09-07 13:02:27,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:27,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-07 13:02:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:27,661 INFO L225 Difference]: With dead ends: 470 [2019-09-07 13:02:27,661 INFO L226 Difference]: Without dead ends: 262 [2019-09-07 13:02:27,663 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,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-07 13:02:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2019-09-07 13:02:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-07 13:02:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-09-07 13:02:27,684 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-09-07 13:02:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:27,685 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-09-07 13:02:27,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-09-07 13:02:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 13:02:27,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:27,691 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:27,691 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:27,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:27,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1669760968, now seen corresponding path program 1 times [2019-09-07 13:02:27,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:27,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:27,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:27,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:27,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:27,787 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:27,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:27,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:27,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:27,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:27,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:27,803 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-09-07 13:02:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:28,039 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-09-07 13:02:28,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:28,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-07 13:02:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:28,043 INFO L225 Difference]: With dead ends: 598 [2019-09-07 13:02:28,043 INFO L226 Difference]: Without dead ends: 354 [2019-09-07 13:02:28,044 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,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-07 13:02:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-09-07 13:02:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-07 13:02:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-09-07 13:02:28,077 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-09-07 13:02:28,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:28,078 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-09-07 13:02:28,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:28,078 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-09-07 13:02:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 13:02:28,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:28,088 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,088 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash 819767994, now seen corresponding path program 1 times [2019-09-07 13:02:28,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:28,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:28,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:28,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:28,181 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,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:28,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:28,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:28,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:28,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:28,183 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-09-07 13:02:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:28,321 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2019-09-07 13:02:28,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:28,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-07 13:02:28,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:28,326 INFO L225 Difference]: With dead ends: 708 [2019-09-07 13:02:28,326 INFO L226 Difference]: Without dead ends: 384 [2019-09-07 13:02:28,327 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,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-07 13:02:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2019-09-07 13:02:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-07 13:02:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-09-07 13:02:28,342 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-09-07 13:02:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:28,342 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-09-07 13:02:28,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-09-07 13:02:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 13:02:28,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:28,345 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:28,345 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:28,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1719879938, now seen corresponding path program 1 times [2019-09-07 13:02:28,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:28,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:28,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:28,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:28,396 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,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:28,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:28,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:28,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:28,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:28,397 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-09-07 13:02:28,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:28,580 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-09-07 13:02:28,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:28,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-07 13:02:28,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:28,584 INFO L225 Difference]: With dead ends: 842 [2019-09-07 13:02:28,584 INFO L226 Difference]: Without dead ends: 478 [2019-09-07 13:02:28,585 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,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-07 13:02:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-09-07 13:02:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-09-07 13:02:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-09-07 13:02:28,601 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-09-07 13:02:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:28,602 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-09-07 13:02:28,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-09-07 13:02:28,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 13:02:28,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:28,604 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, 1] [2019-09-07 13:02:28,604 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:28,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:28,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1093696729, now seen corresponding path program 1 times [2019-09-07 13:02:28,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:28,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:28,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:28,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:28,674 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:28,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:28,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:28,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:28,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:28,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:28,675 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-09-07 13:02:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:28,807 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-09-07 13:02:28,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:28,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-07 13:02:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:28,812 INFO L225 Difference]: With dead ends: 940 [2019-09-07 13:02:28,812 INFO L226 Difference]: Without dead ends: 500 [2019-09-07 13:02:28,813 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,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-09-07 13:02:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-09-07 13:02:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-09-07 13:02:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-09-07 13:02:28,831 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-09-07 13:02:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:28,831 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-09-07 13:02:28,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-09-07 13:02:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 13:02:28,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:28,834 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] [2019-09-07 13:02:28,834 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:28,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:28,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1180839903, now seen corresponding path program 1 times [2019-09-07 13:02:28,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:28,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:28,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:28,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:28,905 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:28,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:28,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:28,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:28,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:28,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:28,914 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-09-07 13:02:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:28,954 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-09-07 13:02:28,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:28,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-07 13:02:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:28,959 INFO L225 Difference]: With dead ends: 976 [2019-09-07 13:02:28,959 INFO L226 Difference]: Without dead ends: 734 [2019-09-07 13:02:28,960 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,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-09-07 13:02:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-09-07 13:02:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-09-07 13:02:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-09-07 13:02:28,981 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-09-07 13:02:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:28,981 INFO L475 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-09-07 13:02:28,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:28,981 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-09-07 13:02:28,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 13:02:28,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:28,984 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, 1] [2019-09-07 13:02:28,984 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:28,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:28,984 INFO L82 PathProgramCache]: Analyzing trace with hash 866854985, now seen corresponding path program 1 times [2019-09-07 13:02:28,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:28,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:28,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:28,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:29,044 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,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:29,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:29,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:29,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:29,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,046 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-09-07 13:02:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:29,093 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-09-07 13:02:29,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:29,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-07 13:02:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:29,100 INFO L225 Difference]: With dead ends: 976 [2019-09-07 13:02:29,100 INFO L226 Difference]: Without dead ends: 974 [2019-09-07 13:02:29,101 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,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-09-07 13:02:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-09-07 13:02:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-07 13:02:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-09-07 13:02:29,132 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-09-07 13:02:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:29,132 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-09-07 13:02:29,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-09-07 13:02:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-07 13:02:29,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:29,136 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 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] [2019-09-07 13:02:29,136 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:29,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:29,137 INFO L82 PathProgramCache]: Analyzing trace with hash -394036509, now seen corresponding path program 1 times [2019-09-07 13:02:29,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:29,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:29,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:29,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-09-07 13:02:29,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:29,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:29,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:29,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:29,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,220 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-09-07 13:02:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:29,385 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-09-07 13:02:29,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:29,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-07 13:02:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:29,391 INFO L225 Difference]: With dead ends: 2140 [2019-09-07 13:02:29,391 INFO L226 Difference]: Without dead ends: 1170 [2019-09-07 13:02:29,394 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,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-07 13:02:29,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-09-07 13:02:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-09-07 13:02:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-09-07 13:02:29,424 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 168 [2019-09-07 13:02:29,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:29,424 INFO L475 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-09-07 13:02:29,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-09-07 13:02:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-07 13:02:29,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:29,429 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2019-09-07 13:02:29,429 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:29,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash 531653490, now seen corresponding path program 1 times [2019-09-07 13:02:29,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:29,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:29,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:29,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-07 13:02:29,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:29,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:29,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:29,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:29,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,508 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-09-07 13:02:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:29,641 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-09-07 13:02:29,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:29,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-07 13:02:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:29,650 INFO L225 Difference]: With dead ends: 2354 [2019-09-07 13:02:29,651 INFO L226 Difference]: Without dead ends: 1236 [2019-09-07 13:02:29,654 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,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-09-07 13:02:29,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-09-07 13:02:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-09-07 13:02:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-09-07 13:02:29,705 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 204 [2019-09-07 13:02:29,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:29,705 INFO L475 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-09-07 13:02:29,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-09-07 13:02:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-07 13:02:29,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:29,717 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:02:29,718 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:29,718 INFO L82 PathProgramCache]: Analyzing trace with hash -354539531, now seen corresponding path program 1 times [2019-09-07 13:02:29,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:29,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:29,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:29,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-09-07 13:02:29,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:29,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:29,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:29,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:29,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:29,871 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-09-07 13:02:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:30,087 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-09-07 13:02:30,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:30,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-07 13:02:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:30,098 INFO L225 Difference]: With dead ends: 2544 [2019-09-07 13:02:30,098 INFO L226 Difference]: Without dead ends: 1334 [2019-09-07 13:02:30,103 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,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-09-07 13:02:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-09-07 13:02:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-09-07 13:02:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-09-07 13:02:30,163 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 225 [2019-09-07 13:02:30,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:30,164 INFO L475 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-09-07 13:02:30,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-09-07 13:02:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-07 13:02:30,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:30,176 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2019-09-07 13:02:30,176 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:30,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1874601560, now seen corresponding path program 1 times [2019-09-07 13:02:30,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:30,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:30,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-07 13:02:30,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:30,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:30,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:30,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:30,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:30,351 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2019-09-07 13:02:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:30,487 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-09-07 13:02:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:30,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-09-07 13:02:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:30,495 INFO L225 Difference]: With dead ends: 2752 [2019-09-07 13:02:30,495 INFO L226 Difference]: Without dead ends: 1442 [2019-09-07 13:02:30,498 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,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-09-07 13:02:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-09-07 13:02:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-09-07 13:02:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-09-07 13:02:30,536 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 249 [2019-09-07 13:02:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:30,537 INFO L475 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-09-07 13:02:30,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:30,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-09-07 13:02:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-07 13:02:30,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:30,543 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2019-09-07 13:02:30,543 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:30,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:30,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1835594086, now seen corresponding path program 1 times [2019-09-07 13:02:30,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:30,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:30,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:30,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:30,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-07 13:02:30,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:30,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:30,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:30,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:30,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:30,635 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-09-07 13:02:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:30,788 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-09-07 13:02:30,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:30,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-09-07 13:02:30,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:30,797 INFO L225 Difference]: With dead ends: 2992 [2019-09-07 13:02:30,797 INFO L226 Difference]: Without dead ends: 1570 [2019-09-07 13:02:30,800 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,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-09-07 13:02:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-09-07 13:02:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-09-07 13:02:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-09-07 13:02:30,842 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 249 [2019-09-07 13:02:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:30,842 INFO L475 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-09-07 13:02:30,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-09-07 13:02:30,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-07 13:02:30,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:30,849 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:30,849 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:30,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:30,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1915187928, now seen corresponding path program 1 times [2019-09-07 13:02:30,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:30,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:30,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:30,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:30,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2019-09-07 13:02:31,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:31,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:31,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:31,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:31,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:31,010 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-09-07 13:02:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:31,072 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-09-07 13:02:31,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:31,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-09-07 13:02:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:31,089 INFO L225 Difference]: With dead ends: 4646 [2019-09-07 13:02:31,090 INFO L226 Difference]: Without dead ends: 3100 [2019-09-07 13:02:31,094 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,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-09-07 13:02:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-09-07 13:02:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-09-07 13:02:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-09-07 13:02:31,171 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 279 [2019-09-07 13:02:31,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:31,171 INFO L475 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-09-07 13:02:31,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:31,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-09-07 13:02:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-07 13:02:31,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:31,180 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:31,181 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:31,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:31,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1795007718, now seen corresponding path program 1 times [2019-09-07 13:02:31,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:31,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:31,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-09-07 13:02:31,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:31,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:31,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:31,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:31,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:31,274 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-09-07 13:02:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:31,446 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-09-07 13:02:31,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:31,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-09-07 13:02:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:31,464 INFO L225 Difference]: With dead ends: 6484 [2019-09-07 13:02:31,464 INFO L226 Difference]: Without dead ends: 3398 [2019-09-07 13:02:31,473 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,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-09-07 13:02:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-09-07 13:02:31,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-09-07 13:02:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-09-07 13:02:31,570 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 279 [2019-09-07 13:02:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:31,571 INFO L475 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-09-07 13:02:31,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-09-07 13:02:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-07 13:02:31,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:31,582 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 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, 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,583 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:31,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1052232894, now seen corresponding path program 1 times [2019-09-07 13:02:31,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:31,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:31,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:31,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:31,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2019-09-07 13:02:31,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:31,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:31,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:31,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:31,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:31,719 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-09-07 13:02:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:31,871 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-09-07 13:02:31,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:31,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-09-07 13:02:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:31,892 INFO L225 Difference]: With dead ends: 6900 [2019-09-07 13:02:31,892 INFO L226 Difference]: Without dead ends: 3530 [2019-09-07 13:02:31,901 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,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-09-07 13:02:32,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-09-07 13:02:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-09-07 13:02:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-09-07 13:02:32,011 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 303 [2019-09-07 13:02:32,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:32,011 INFO L475 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-09-07 13:02:32,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-09-07 13:02:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-07 13:02:32,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:32,028 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 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, 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] [2019-09-07 13:02:32,029 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1022376132, now seen corresponding path program 1 times [2019-09-07 13:02:32,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:32,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:32,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:32,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:32,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-09-07 13:02:32,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:32,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:32,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:32,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:32,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:32,182 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-09-07 13:02:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:32,355 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-09-07 13:02:32,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:32,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-07 13:02:32,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:32,373 INFO L225 Difference]: With dead ends: 7416 [2019-09-07 13:02:32,373 INFO L226 Difference]: Without dead ends: 3914 [2019-09-07 13:02:32,380 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,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-09-07 13:02:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-09-07 13:02:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-09-07 13:02:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-09-07 13:02:32,460 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 314 [2019-09-07 13:02:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:32,461 INFO L475 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-09-07 13:02:32,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:32,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-09-07 13:02:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-07 13:02:32,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:32,473 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 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, 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:32,473 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:32,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:32,473 INFO L82 PathProgramCache]: Analyzing trace with hash -773017638, now seen corresponding path program 1 times [2019-09-07 13:02:32,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:32,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:32,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:32,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:32,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-09-07 13:02:32,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:32,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:32,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:32,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:32,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:32,571 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-09-07 13:02:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:32,750 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-09-07 13:02:32,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:32,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-07 13:02:32,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:32,782 INFO L225 Difference]: With dead ends: 8048 [2019-09-07 13:02:32,784 INFO L226 Difference]: Without dead ends: 4234 [2019-09-07 13:02:32,792 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,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-09-07 13:02:32,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-09-07 13:02:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-09-07 13:02:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-09-07 13:02:32,878 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 328 [2019-09-07 13:02:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:32,879 INFO L475 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-09-07 13:02:32,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-09-07 13:02:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-07 13:02:32,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:32,891 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:32,891 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:32,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash -815480887, now seen corresponding path program 1 times [2019-09-07 13:02:32,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:32,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:32,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:32,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:32,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-09-07 13:02:33,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:33,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:33,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:33,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:33,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:33,143 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-09-07 13:02:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:33,218 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-09-07 13:02:33,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:33,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-07 13:02:33,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:33,236 INFO L225 Difference]: With dead ends: 11310 [2019-09-07 13:02:33,236 INFO L226 Difference]: Without dead ends: 7376 [2019-09-07 13:02:33,245 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,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-09-07 13:02:33,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-09-07 13:02:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-09-07 13:02:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-09-07 13:02:33,374 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 329 [2019-09-07 13:02:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:33,375 INFO L475 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-09-07 13:02:33,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-09-07 13:02:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-07 13:02:33,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:33,388 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 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, 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:33,389 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:33,389 INFO L82 PathProgramCache]: Analyzing trace with hash 415461791, now seen corresponding path program 1 times [2019-09-07 13:02:33,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:33,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:33,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:33,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:33,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-09-07 13:02:33,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:33,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:33,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:33,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:33,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:33,489 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-09-07 13:02:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:33,764 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-09-07 13:02:33,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:33,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-07 13:02:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:33,789 INFO L225 Difference]: With dead ends: 14744 [2019-09-07 13:02:33,790 INFO L226 Difference]: Without dead ends: 7382 [2019-09-07 13:02:33,809 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,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-09-07 13:02:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-09-07 13:02:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-09-07 13:02:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-09-07 13:02:34,170 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 330 [2019-09-07 13:02:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:34,171 INFO L475 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-09-07 13:02:34,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-09-07 13:02:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-07 13:02:34,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:34,192 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,193 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:34,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:34,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1238161908, now seen corresponding path program 1 times [2019-09-07 13:02:34,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:34,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:34,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:34,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:34,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 874 proven. 10 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-09-07 13:02:34,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:02:34,427 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) [2019-09-07 13:02:34,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:02:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:34,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 13:02:34,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:02:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 13:02:34,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:02:34,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-09-07 13:02:34,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:02:34,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:02:34,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:02:34,793 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 7 states. [2019-09-07 13:02:35,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:35,626 INFO L93 Difference]: Finished difference Result 18408 states and 23982 transitions. [2019-09-07 13:02:35,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:02:35,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 353 [2019-09-07 13:02:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:35,662 INFO L225 Difference]: With dead ends: 18408 [2019-09-07 13:02:35,662 INFO L226 Difference]: Without dead ends: 11034 [2019-09-07 13:02:35,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-07 13:02:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2019-09-07 13:02:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2019-09-07 13:02:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-09-07 13:02:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-09-07 13:02:36,174 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 353 [2019-09-07 13:02:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:36,175 INFO L475 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-09-07 13:02:36,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:02:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-09-07 13:02:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-09-07 13:02:36,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:36,200 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:36,200 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:36,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:36,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1345653892, now seen corresponding path program 1 times [2019-09-07 13:02:36,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:36,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:36,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:36,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:36,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-09-07 13:02:36,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:02:36,486 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) [2019-09-07 13:02:36,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:02:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:36,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:02:36,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:02:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-09-07 13:02:36,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:02:36,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-07 13:02:36,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:02:36,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:02:36,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:02:36,868 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 4 states. [2019-09-07 13:02:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:37,318 INFO L93 Difference]: Finished difference Result 19118 states and 24882 transitions. [2019-09-07 13:02:37,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:02:37,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-09-07 13:02:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:37,343 INFO L225 Difference]: With dead ends: 19118 [2019-09-07 13:02:37,344 INFO L226 Difference]: Without dead ends: 10668 [2019-09-07 13:02:37,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:02:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2019-09-07 13:02:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 8518. [2019-09-07 13:02:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2019-09-07 13:02:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 10888 transitions. [2019-09-07 13:02:37,664 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 10888 transitions. Word has length 379 [2019-09-07 13:02:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:37,665 INFO L475 AbstractCegarLoop]: Abstraction has 8518 states and 10888 transitions. [2019-09-07 13:02:37,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:02:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 10888 transitions. [2019-09-07 13:02:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-09-07 13:02:37,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:37,683 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:37,684 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:37,684 INFO L82 PathProgramCache]: Analyzing trace with hash -391768364, now seen corresponding path program 1 times [2019-09-07 13:02:37,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:37,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:37,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-09-07 13:02:37,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:37,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:37,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:37,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:37,845 INFO L87 Difference]: Start difference. First operand 8518 states and 10888 transitions. Second operand 3 states. [2019-09-07 13:02:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:38,051 INFO L93 Difference]: Finished difference Result 15876 states and 19733 transitions. [2019-09-07 13:02:38,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:38,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-09-07 13:02:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:38,060 INFO L225 Difference]: With dead ends: 15876 [2019-09-07 13:02:38,060 INFO L226 Difference]: Without dead ends: 3820 [2019-09-07 13:02:38,084 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,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2019-09-07 13:02:38,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3610. [2019-09-07 13:02:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3610 states. [2019-09-07 13:02:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4508 transitions. [2019-09-07 13:02:38,159 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 4508 transitions. Word has length 418 [2019-09-07 13:02:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:38,159 INFO L475 AbstractCegarLoop]: Abstraction has 3610 states and 4508 transitions. [2019-09-07 13:02:38,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 4508 transitions. [2019-09-07 13:02:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-09-07 13:02:38,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:38,169 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 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, 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:38,169 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:38,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1077932443, now seen corresponding path program 1 times [2019-09-07 13:02:38,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:38,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:38,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:38,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:38,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-09-07 13:02:38,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:02:38,468 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) [2019-09-07 13:02:38,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:02:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:38,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:02:38,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:02:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-09-07 13:02:39,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:02:39,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 13:02:39,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:02:39,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:02:39,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:02:39,010 INFO L87 Difference]: Start difference. First operand 3610 states and 4508 transitions. Second operand 5 states. [2019-09-07 13:02:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:39,268 INFO L93 Difference]: Finished difference Result 4555 states and 5673 transitions. [2019-09-07 13:02:39,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:02:39,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 516 [2019-09-07 13:02:39,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:39,269 INFO L225 Difference]: With dead ends: 4555 [2019-09-07 13:02:39,269 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 13:02:39,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 518 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,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 13:02:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 13:02:39,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 13:02:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 13:02:39,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 516 [2019-09-07 13:02:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:39,276 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 13:02:39,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:02:39,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 13:02:39,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 13:02:39,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 13:02:39,401 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 37 [2019-09-07 13:02:40,467 WARN L188 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 429 DAG size of output: 100 [2019-09-07 13:02:41,351 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2019-09-07 13:02:42,085 WARN L188 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-07 13:02:42,150 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-07 13:02:42,151 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:02:42,151 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-09-07 13:02:42,151 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2019-09-07 13:02:42,151 INFO L446 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2019-09-07 13:02:42,151 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2019-09-07 13:02:42,151 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2019-09-07 13:02:42,151 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2019-09-07 13:02:42,152 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-09-07 13:02:42,152 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2019-09-07 13:02:42,152 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-09-07 13:02:42,152 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-09-07 13:02:42,152 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2019-09-07 13:02:42,152 INFO L443 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2019-09-07 13:02:42,152 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-09-07 13:02:42,153 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-09-07 13:02:42,153 INFO L443 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2019-09-07 13:02:42,153 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2019-09-07 13:02:42,153 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2019-09-07 13:02:42,153 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2019-09-07 13:02:42,153 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2019-09-07 13:02:42,153 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2019-09-07 13:02:42,154 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-09-07 13:02:42,154 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2019-09-07 13:02:42,154 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2019-09-07 13:02:42,154 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-09-07 13:02:42,154 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2019-09-07 13:02:42,154 INFO L439 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-09-07 13:02:42,154 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2019-09-07 13:02:42,154 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2019-09-07 13:02:42,155 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2019-09-07 13:02:42,155 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-09-07 13:02:42,155 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2019-09-07 13:02:42,155 INFO L443 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2019-09-07 13:02:42,155 INFO L446 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2019-09-07 13:02:42,155 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-09-07 13:02:42,155 INFO L443 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2019-09-07 13:02:42,155 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2019-09-07 13:02:42,156 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2019-09-07 13:02:42,156 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2019-09-07 13:02:42,156 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-09-07 13:02:42,156 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2019-09-07 13:02:42,156 INFO L443 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2019-09-07 13:02:42,156 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2019-09-07 13:02:42,156 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2019-09-07 13:02:42,156 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2019-09-07 13:02:42,157 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-09-07 13:02:42,157 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2019-09-07 13:02:42,157 INFO L443 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2019-09-07 13:02:42,157 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2019-09-07 13:02:42,157 INFO L443 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2019-09-07 13:02:42,157 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2019-09-07 13:02:42,157 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-09-07 13:02:42,157 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2019-09-07 13:02:42,158 INFO L443 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2019-09-07 13:02:42,158 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2019-09-07 13:02:42,158 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2019-09-07 13:02:42,158 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2019-09-07 13:02:42,158 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2019-09-07 13:02:42,158 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2019-09-07 13:02:42,158 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-09-07 13:02:42,158 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2019-09-07 13:02:42,159 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-09-07 13:02:42,159 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-09-07 13:02:42,159 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2019-09-07 13:02:42,159 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2019-09-07 13:02:42,159 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2019-09-07 13:02:42,159 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2019-09-07 13:02:42,159 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2019-09-07 13:02:42,159 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2019-09-07 13:02:42,160 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-09-07 13:02:42,160 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-09-07 13:02:42,160 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2019-09-07 13:02:42,160 INFO L443 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2019-09-07 13:02:42,160 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2019-09-07 13:02:42,160 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-09-07 13:02:42,160 INFO L443 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2019-09-07 13:02:42,160 INFO L443 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2019-09-07 13:02:42,160 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2019-09-07 13:02:42,161 INFO L439 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse9 (not .cse1)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse12 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse13 (= 4464 ssl3_connect_~s__state~0)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse16 (= 4400 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= 4448 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse7 .cse8 .cse9) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11 .cse9) (and .cse5 .cse0 .cse1) (and .cse12 .cse6 .cse1) (and .cse3 .cse13 .cse1) (and .cse6 .cse5) (and .cse3 .cse14 .cse1) (and .cse3 .cse7 .cse1 .cse8 .cse15) (and .cse12 .cse3) (and .cse6 (= 4384 ssl3_connect_~s__state~0)) (and .cse3 .cse1 .cse2) (and .cse13 .cse0 .cse1) (and .cse3 .cse0 .cse16 .cse1) (and .cse6 .cse14) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse14 .cse0 .cse1) (and .cse3 .cse1 .cse17) (and .cse6 .cse16 .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse10 .cse11 .cse1 .cse15) (and .cse4 .cse0 .cse1) (and .cse0 .cse1 (= 4416 ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse17) (<= ssl3_connect_~blastFlag~0 0)))) [2019-09-07 13:02:42,161 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2019-09-07 13:02:42,161 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2019-09-07 13:02:42,161 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2019-09-07 13:02:42,161 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2019-09-07 13:02:42,162 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2019-09-07 13:02:42,162 INFO L439 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-09-07 13:02:42,162 INFO L443 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2019-09-07 13:02:42,162 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2019-09-07 13:02:42,162 INFO L443 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2019-09-07 13:02:42,162 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2019-09-07 13:02:42,162 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2019-09-07 13:02:42,162 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2019-09-07 13:02:42,162 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-09-07 13:02:42,163 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-09-07 13:02:42,163 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2019-09-07 13:02:42,163 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-09-07 13:02:42,163 INFO L443 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2019-09-07 13:02:42,163 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2019-09-07 13:02:42,163 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2019-09-07 13:02:42,163 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2019-09-07 13:02:42,163 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-09-07 13:02:42,163 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2019-09-07 13:02:42,164 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-09-07 13:02:42,164 INFO L443 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2019-09-07 13:02:42,164 INFO L439 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 (not .cse1)))) [2019-09-07 13:02:42,164 INFO L439 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-09-07 13:02:42,164 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2019-09-07 13:02:42,164 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2019-09-07 13:02:42,164 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2019-09-07 13:02:42,164 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2019-09-07 13:02:42,165 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2019-09-07 13:02:42,165 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2019-09-07 13:02:42,165 INFO L443 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2019-09-07 13:02:42,165 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2019-09-07 13:02:42,165 INFO L439 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2019-09-07 13:02:42,165 INFO L439 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-09-07 13:02:42,165 INFO L443 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2019-09-07 13:02:42,166 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-09-07 13:02:42,166 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2019-09-07 13:02:42,166 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2019-09-07 13:02:42,166 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2019-09-07 13:02:42,166 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2019-09-07 13:02:42,166 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2019-09-07 13:02:42,166 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2019-09-07 13:02:42,166 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 511) 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 (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1))) [2019-09-07 13:02:42,167 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 13:02:42,167 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-09-07 13:02:42,167 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:02:42,167 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-07 13:02:42,167 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:02:42,167 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:02:42,167 INFO L439 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2019-09-07 13:02:42,167 INFO L443 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2019-09-07 13:02:42,167 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2019-09-07 13:02:42,168 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2019-09-07 13:02:42,168 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2019-09-07 13:02:42,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 01:02:42 BoogieIcfgContainer [2019-09-07 13:02:42,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 13:02:42,214 INFO L168 Benchmark]: Toolchain (without parser) took 16710.54 ms. Allocated memory was 134.2 MB in the beginning and 1.1 GB in the end (delta: 976.7 MB). Free memory was 88.3 MB in the beginning and 982.6 MB in the end (delta: -894.3 MB). Peak memory consumption was 848.7 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:42,215 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 134.2 MB. Free memory was 107.3 MB in the beginning and 107.1 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:42,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.44 ms. Allocated memory was 134.2 MB in the beginning and 217.1 MB in the end (delta: 82.8 MB). Free memory was 88.1 MB in the beginning and 199.5 MB in the end (delta: -111.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:42,219 INFO L168 Benchmark]: Boogie Preprocessor took 50.22 ms. Allocated memory is still 217.1 MB. Free memory was 199.5 MB in the beginning and 196.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:42,219 INFO L168 Benchmark]: RCFGBuilder took 697.07 ms. Allocated memory is still 217.1 MB. Free memory was 196.4 MB in the beginning and 150.6 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:42,222 INFO L168 Benchmark]: TraceAbstraction took 15500.01 ms. Allocated memory was 217.1 MB in the beginning and 1.1 GB in the end (delta: 893.9 MB). Free memory was 150.6 MB in the beginning and 982.6 MB in the end (delta: -832.0 MB). Peak memory consumption was 828.2 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:42,228 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.37 ms. Allocated memory is still 134.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 458.44 ms. Allocated memory was 134.2 MB in the beginning and 217.1 MB in the end (delta: 82.8 MB). Free memory was 88.1 MB in the beginning and 199.5 MB in the end (delta: -111.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.22 ms. Allocated memory is still 217.1 MB. Free memory was 199.5 MB in the beginning and 196.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 697.07 ms. Allocated memory is still 217.1 MB. Free memory was 196.4 MB in the beginning and 150.6 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15500.01 ms. Allocated memory was 217.1 MB in the beginning and 1.1 GB in the end (delta: 893.9 MB). Free memory was 150.6 MB in the beginning and 982.6 MB in the end (delta: -832.0 MB). Peak memory consumption was 828.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (blastFlag <= 0 && 4560 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && 4384 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((4464 == s__state && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && 4400 == s__state) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || !(12292 <= \old(initial_state))) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 4416 == s__state)) || ((blastFlag <= 4 && s__hit == 0) && 4448 == s__state)) || blastFlag <= 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((blastFlag <= 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)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 136 locations, 1 error locations. SAFE Result, 15.3s OverallTime, 24 OverallIterations, 20 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 4971 SDtfs, 1932 SDslu, 3379 SDs, 0 SdLazy, 2650 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1335 GetRequests, 1296 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8518occurred in iteration=22, 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.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 5532 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 269 NumberOfFragments, 773 HoareAnnotationTreeSize, 26 FomulaSimplifications, 17947 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1648 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 6709 NumberOfCodeBlocks, 6709 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6682 ConstructedInterpolants, 0 QuantifiedInterpolants, 3264518 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2309 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 26313/26347 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...