java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:02:35,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:02:35,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:02:35,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:02:35,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:02:35,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:02:35,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:02:35,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:02:35,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:02:35,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:02:35,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:02:35,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:02:35,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:02:35,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:02:35,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:02:35,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:02:35,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:02:35,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:02:35,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:02:35,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:02:35,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:02:35,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:02:35,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:02:35,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:02:35,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:02:35,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:02:35,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:02:35,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:02:35,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:02:35,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:02:35,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:02:35,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:02:35,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:02:35,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:02:35,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:02:35,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:02:35,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:02:35,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:02:35,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:02:35,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:02:35,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:02:35,366 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:35,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:02:35,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:02:35,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:02:35,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:02:35,382 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:02:35,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:02:35,383 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:02:35,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:02:35,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:02:35,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:02:35,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:02:35,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:02:35,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:02:35,384 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:02:35,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:02:35,385 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:02:35,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:02:35,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:02:35,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:02:35,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:02:35,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:02:35,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:02:35,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:02:35,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:02:35,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:02:35,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:02:35,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:02:35,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:02:35,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:02:35,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:02:35,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:02:35,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:02:35,432 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:02:35,432 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:02:35,433 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c [2019-09-07 13:02:35,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503acdd3f/94d6d108b23b440db93dcb2b9045f37e/FLAG3c21eecd0 [2019-09-07 13:02:36,010 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:02:36,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c [2019-09-07 13:02:36,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503acdd3f/94d6d108b23b440db93dcb2b9045f37e/FLAG3c21eecd0 [2019-09-07 13:02:36,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503acdd3f/94d6d108b23b440db93dcb2b9045f37e [2019-09-07 13:02:36,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:02:36,330 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:02:36,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:02:36,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:02:36,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:02:36,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:02:36" (1/1) ... [2019-09-07 13:02:36,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23dba457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:36, skipping insertion in model container [2019-09-07 13:02:36,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:02:36" (1/1) ... [2019-09-07 13:02:36,347 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:02:36,405 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:02:36,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:02:36,799 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:02:36,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:02:36,889 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:02:36,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:36 WrapperNode [2019-09-07 13:02:36,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:02:36,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:02:36,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:02:36,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:02:36,900 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:36" (1/1) ... [2019-09-07 13:02:36,900 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:36" (1/1) ... [2019-09-07 13:02:36,909 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:36" (1/1) ... [2019-09-07 13:02:36,910 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:36" (1/1) ... [2019-09-07 13:02:36,924 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:36" (1/1) ... [2019-09-07 13:02:36,936 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:36" (1/1) ... [2019-09-07 13:02:36,939 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:36" (1/1) ... [2019-09-07 13:02:36,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:02:36,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:02:36,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:02:36,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:02:36,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:36" (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:37,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:02:37,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:02:37,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-07 13:02:37,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:02:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:02:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-07 13:02:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:02:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-07 13:02:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-07 13:02:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-07 13:02:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:02:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:02:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:02:37,164 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:02:37,673 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-07 13:02:37,674 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-07 13:02:37,687 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:02:37,687 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:02:37,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:02:37 BoogieIcfgContainer [2019-09-07 13:02:37,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:02:37,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:02:37,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:02:37,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:02:37,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:02:36" (1/3) ... [2019-09-07 13:02:37,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788045f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:02:37, skipping insertion in model container [2019-09-07 13:02:37,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:02:36" (2/3) ... [2019-09-07 13:02:37,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788045f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:02:37, skipping insertion in model container [2019-09-07 13:02:37,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:02:37" (3/3) ... [2019-09-07 13:02:37,708 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c [2019-09-07 13:02:37,721 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:02:37,732 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:02:37,750 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:02:37,789 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:02:37,789 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:02:37,790 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:02:37,790 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:02:37,790 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:02:37,790 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:02:37,790 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:02:37,790 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:02:37,791 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:02:37,811 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-09-07 13:02:37,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 13:02:37,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:37,819 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:37,821 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:37,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:37,826 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-09-07 13:02:37,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:37,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:37,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:38,067 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:38,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:38,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:38,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:38,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:38,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:38,090 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-09-07 13:02:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:38,223 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-09-07 13:02:38,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:38,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-07 13:02:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:38,240 INFO L225 Difference]: With dead ends: 377 [2019-09-07 13:02:38,240 INFO L226 Difference]: Without dead ends: 220 [2019-09-07 13:02:38,244 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,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-07 13:02:38,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-09-07 13:02:38,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-07 13:02:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-09-07 13:02:38,314 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-09-07 13:02:38,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:38,319 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-09-07 13:02:38,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-09-07 13:02:38,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 13:02:38,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:38,325 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:38,326 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:38,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:38,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2019-09-07 13:02:38,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:38,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:38,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:38,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:38,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:38,448 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:38,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:38,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:38,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:38,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:38,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:38,451 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-09-07 13:02:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:38,643 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2019-09-07 13:02:38,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:38,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-07 13:02:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:38,647 INFO L225 Difference]: With dead ends: 472 [2019-09-07 13:02:38,647 INFO L226 Difference]: Without dead ends: 264 [2019-09-07 13:02:38,649 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,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-07 13:02:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2019-09-07 13:02:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-07 13:02:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-09-07 13:02:38,669 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-09-07 13:02:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:38,670 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-09-07 13:02:38,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-09-07 13:02:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 13:02:38,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:38,676 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:38,676 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:38,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:38,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1571737336, now seen corresponding path program 1 times [2019-09-07 13:02:38,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:38,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:38,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:38,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:38,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:38,806 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:38,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:38,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:38,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:38,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:38,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:38,809 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-09-07 13:02:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:39,032 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-09-07 13:02:39,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:39,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-07 13:02:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:39,036 INFO L225 Difference]: With dead ends: 598 [2019-09-07 13:02:39,036 INFO L226 Difference]: Without dead ends: 354 [2019-09-07 13:02:39,038 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:39,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-07 13:02:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-09-07 13:02:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-07 13:02:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-09-07 13:02:39,058 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-09-07 13:02:39,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:39,058 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-09-07 13:02:39,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-09-07 13:02:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 13:02:39,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:39,062 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:39,062 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:39,063 INFO L82 PathProgramCache]: Analyzing trace with hash -233700998, now seen corresponding path program 1 times [2019-09-07 13:02:39,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:39,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:39,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:39,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:39,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:39,136 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:39,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:39,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:39,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:39,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:39,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:39,138 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-09-07 13:02:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:39,288 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2019-09-07 13:02:39,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:39,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-07 13:02:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:39,296 INFO L225 Difference]: With dead ends: 708 [2019-09-07 13:02:39,297 INFO L226 Difference]: Without dead ends: 384 [2019-09-07 13:02:39,299 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:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-07 13:02:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2019-09-07 13:02:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-07 13:02:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-09-07 13:02:39,322 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-09-07 13:02:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:39,323 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-09-07 13:02:39,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-09-07 13:02:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 13:02:39,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:39,327 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:39,327 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:39,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:39,328 INFO L82 PathProgramCache]: Analyzing trace with hash -343872958, now seen corresponding path program 1 times [2019-09-07 13:02:39,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:39,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:39,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:39,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:39,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:39,407 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:39,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:39,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:39,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:39,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:39,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:39,410 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-09-07 13:02:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:39,623 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-09-07 13:02:39,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:39,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-07 13:02:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:39,626 INFO L225 Difference]: With dead ends: 842 [2019-09-07 13:02:39,626 INFO L226 Difference]: Without dead ends: 478 [2019-09-07 13:02:39,627 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:39,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-07 13:02:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-09-07 13:02:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-09-07 13:02:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-09-07 13:02:39,644 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-09-07 13:02:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:39,645 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-09-07 13:02:39,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-09-07 13:02:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 13:02:39,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:39,648 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:39,649 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:39,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:39,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1570407527, now seen corresponding path program 1 times [2019-09-07 13:02:39,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:39,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:39,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:39,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:39,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:39,696 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:39,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:39,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:39,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:39,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:39,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:39,698 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-09-07 13:02:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:39,829 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-09-07 13:02:39,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:39,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-07 13:02:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:39,834 INFO L225 Difference]: With dead ends: 940 [2019-09-07 13:02:39,834 INFO L226 Difference]: Without dead ends: 500 [2019-09-07 13:02:39,836 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:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-09-07 13:02:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-09-07 13:02:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-09-07 13:02:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-09-07 13:02:39,859 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-09-07 13:02:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:39,863 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-09-07 13:02:39,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:39,863 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-09-07 13:02:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 13:02:39,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:39,865 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:39,866 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:39,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1356861727, now seen corresponding path program 1 times [2019-09-07 13:02:39,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:39,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:39,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:39,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:39,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:39,956 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:39,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:39,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:39,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:39,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:39,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:39,967 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-09-07 13:02:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:40,007 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-09-07 13:02:40,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:40,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-07 13:02:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:40,011 INFO L225 Difference]: With dead ends: 976 [2019-09-07 13:02:40,011 INFO L226 Difference]: Without dead ends: 734 [2019-09-07 13:02:40,012 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:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-09-07 13:02:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-09-07 13:02:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-09-07 13:02:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-09-07 13:02:40,034 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-09-07 13:02:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:40,035 INFO L475 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-09-07 13:02:40,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-09-07 13:02:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 13:02:40,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:40,037 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:40,038 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1774863991, now seen corresponding path program 1 times [2019-09-07 13:02:40,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:40,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:40,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:40,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:40,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:40,099 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:40,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:40,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:40,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:40,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:40,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:40,102 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-09-07 13:02:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:40,141 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-09-07 13:02:40,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:40,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-07 13:02:40,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:40,147 INFO L225 Difference]: With dead ends: 976 [2019-09-07 13:02:40,147 INFO L226 Difference]: Without dead ends: 974 [2019-09-07 13:02:40,148 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:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-09-07 13:02:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-09-07 13:02:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-07 13:02:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-09-07 13:02:40,176 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-09-07 13:02:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:40,177 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-09-07 13:02:40,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-09-07 13:02:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-07 13:02:40,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:40,199 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:40,199 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:40,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:40,199 INFO L82 PathProgramCache]: Analyzing trace with hash 600728947, now seen corresponding path program 1 times [2019-09-07 13:02:40,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:40,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:40,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:40,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:40,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 13:02:40,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:40,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:40,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:40,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:40,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:40,283 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-09-07 13:02:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:40,473 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-09-07 13:02:40,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:40,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-07 13:02:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:40,481 INFO L225 Difference]: With dead ends: 2140 [2019-09-07 13:02:40,481 INFO L226 Difference]: Without dead ends: 1170 [2019-09-07 13:02:40,484 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:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-07 13:02:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-09-07 13:02:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-09-07 13:02:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-09-07 13:02:40,526 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 154 [2019-09-07 13:02:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:40,526 INFO L475 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-09-07 13:02:40,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-09-07 13:02:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-07 13:02:40,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:40,534 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:40,534 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:40,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:40,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1176011842, now seen corresponding path program 1 times [2019-09-07 13:02:40,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:40,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:40,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:40,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:40,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-09-07 13:02:40,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:40,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:40,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:40,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:40,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:40,671 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-09-07 13:02:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:40,868 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-09-07 13:02:40,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:40,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-07 13:02:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:40,877 INFO L225 Difference]: With dead ends: 2354 [2019-09-07 13:02:40,877 INFO L226 Difference]: Without dead ends: 1236 [2019-09-07 13:02:40,880 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:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-09-07 13:02:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-09-07 13:02:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-09-07 13:02:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-09-07 13:02:40,925 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 190 [2019-09-07 13:02:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:40,926 INFO L475 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-09-07 13:02:40,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-09-07 13:02:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-07 13:02:40,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:40,934 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:40,934 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:40,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:40,935 INFO L82 PathProgramCache]: Analyzing trace with hash -717257595, now seen corresponding path program 1 times [2019-09-07 13:02:40,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:40,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:40,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:40,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:40,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-07 13:02:41,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:41,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:41,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:41,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:41,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:41,039 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-09-07 13:02:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:41,200 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-09-07 13:02:41,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:41,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-09-07 13:02:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:41,208 INFO L225 Difference]: With dead ends: 2544 [2019-09-07 13:02:41,208 INFO L226 Difference]: Without dead ends: 1334 [2019-09-07 13:02:41,212 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:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-09-07 13:02:41,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-09-07 13:02:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-09-07 13:02:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-09-07 13:02:41,248 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 211 [2019-09-07 13:02:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:41,248 INFO L475 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-09-07 13:02:41,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-09-07 13:02:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-07 13:02:41,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:41,253 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:41,254 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:41,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:41,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1079909240, now seen corresponding path program 1 times [2019-09-07 13:02:41,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:41,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:41,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:41,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:41,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-07 13:02:41,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:41,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:41,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:41,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:41,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:41,377 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2019-09-07 13:02:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:41,515 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-09-07 13:02:41,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:41,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-09-07 13:02:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:41,522 INFO L225 Difference]: With dead ends: 2752 [2019-09-07 13:02:41,522 INFO L226 Difference]: Without dead ends: 1442 [2019-09-07 13:02:41,525 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:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-09-07 13:02:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-09-07 13:02:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-09-07 13:02:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-09-07 13:02:41,569 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 235 [2019-09-07 13:02:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:41,569 INFO L475 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-09-07 13:02:41,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-09-07 13:02:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-07 13:02:41,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:41,575 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:41,576 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1213171786, now seen corresponding path program 1 times [2019-09-07 13:02:41,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:41,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:41,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:41,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:41,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-07 13:02:41,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:41,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:41,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:41,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:41,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:41,688 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-09-07 13:02:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:41,840 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-09-07 13:02:41,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:41,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-09-07 13:02:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:41,848 INFO L225 Difference]: With dead ends: 2992 [2019-09-07 13:02:41,848 INFO L226 Difference]: Without dead ends: 1570 [2019-09-07 13:02:41,851 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:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-09-07 13:02:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-09-07 13:02:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-09-07 13:02:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-09-07 13:02:41,892 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 235 [2019-09-07 13:02:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:41,893 INFO L475 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-09-07 13:02:41,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-09-07 13:02:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-07 13:02:41,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:41,899 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:41,899 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:41,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1569112328, now seen corresponding path program 1 times [2019-09-07 13:02:41,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:41,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:41,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:41,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:41,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-09-07 13:02:42,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:42,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:42,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:42,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:42,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:42,015 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-09-07 13:02:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:42,070 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-09-07 13:02:42,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:42,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-07 13:02:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:42,085 INFO L225 Difference]: With dead ends: 4646 [2019-09-07 13:02:42,085 INFO L226 Difference]: Without dead ends: 3100 [2019-09-07 13:02:42,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:42,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-09-07 13:02:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-09-07 13:02:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-09-07 13:02:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-09-07 13:02:42,164 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 265 [2019-09-07 13:02:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:42,165 INFO L475 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-09-07 13:02:42,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-09-07 13:02:42,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-07 13:02:42,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:42,174 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:42,174 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:42,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:42,174 INFO L82 PathProgramCache]: Analyzing trace with hash 432773942, now seen corresponding path program 1 times [2019-09-07 13:02:42,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:42,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:42,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:42,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:42,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-09-07 13:02:42,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:42,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:42,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:42,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:42,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:42,281 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-09-07 13:02:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:42,460 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-09-07 13:02:42,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:42,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-07 13:02:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:42,476 INFO L225 Difference]: With dead ends: 6484 [2019-09-07 13:02:42,476 INFO L226 Difference]: Without dead ends: 3398 [2019-09-07 13:02:42,484 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:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-09-07 13:02:42,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-09-07 13:02:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-09-07 13:02:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-09-07 13:02:42,575 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 265 [2019-09-07 13:02:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:42,576 INFO L475 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-09-07 13:02:42,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-09-07 13:02:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-07 13:02:42,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:42,585 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:42,585 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:42,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:42,586 INFO L82 PathProgramCache]: Analyzing trace with hash -764797682, now seen corresponding path program 1 times [2019-09-07 13:02:42,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:42,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:42,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:42,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:42,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-09-07 13:02:42,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:42,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:42,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:42,684 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-09-07 13:02:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:42,836 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-09-07 13:02:42,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:42,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-09-07 13:02:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:42,852 INFO L225 Difference]: With dead ends: 6900 [2019-09-07 13:02:42,853 INFO L226 Difference]: Without dead ends: 3530 [2019-09-07 13:02:42,859 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:42,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-09-07 13:02:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-09-07 13:02:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-09-07 13:02:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-09-07 13:02:42,966 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 289 [2019-09-07 13:02:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:42,966 INFO L475 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-09-07 13:02:42,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-09-07 13:02:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-07 13:02:42,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:42,976 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:42,977 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:42,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:42,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2053251468, now seen corresponding path program 1 times [2019-09-07 13:02:42,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:42,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:42,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-07 13:02:43,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:43,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:43,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:43,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:43,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:43,077 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-09-07 13:02:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:43,255 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-09-07 13:02:43,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:43,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-07 13:02:43,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:43,275 INFO L225 Difference]: With dead ends: 7416 [2019-09-07 13:02:43,275 INFO L226 Difference]: Without dead ends: 3914 [2019-09-07 13:02:43,283 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:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-09-07 13:02:43,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-09-07 13:02:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-09-07 13:02:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-09-07 13:02:43,364 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 300 [2019-09-07 13:02:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:43,364 INFO L475 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-09-07 13:02:43,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-09-07 13:02:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-07 13:02:43,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:43,375 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:43,376 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:43,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:43,376 INFO L82 PathProgramCache]: Analyzing trace with hash 816481962, now seen corresponding path program 1 times [2019-09-07 13:02:43,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:43,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:43,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:43,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:43,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-09-07 13:02:43,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:43,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:43,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:43,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:43,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:43,538 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-09-07 13:02:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:43,715 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-09-07 13:02:43,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:43,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-07 13:02:43,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:43,733 INFO L225 Difference]: With dead ends: 8048 [2019-09-07 13:02:43,734 INFO L226 Difference]: Without dead ends: 4234 [2019-09-07 13:02:43,741 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:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-09-07 13:02:43,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-09-07 13:02:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-09-07 13:02:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-09-07 13:02:43,821 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 314 [2019-09-07 13:02:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:43,822 INFO L475 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-09-07 13:02:43,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-09-07 13:02:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-07 13:02:43,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:43,833 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:43,833 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:43,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:43,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1006853977, now seen corresponding path program 1 times [2019-09-07 13:02:43,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:43,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:43,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:43,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:43,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 707 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-09-07 13:02:43,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:43,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:43,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:43,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:43,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:43,996 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-09-07 13:02:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:44,069 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-09-07 13:02:44,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:44,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-07 13:02:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:44,095 INFO L225 Difference]: With dead ends: 11310 [2019-09-07 13:02:44,095 INFO L226 Difference]: Without dead ends: 7376 [2019-09-07 13:02:44,104 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:44,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-09-07 13:02:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-09-07 13:02:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-09-07 13:02:44,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-09-07 13:02:44,228 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 315 [2019-09-07 13:02:44,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:44,229 INFO L475 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-09-07 13:02:44,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:44,229 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-09-07 13:02:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-07 13:02:44,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:44,244 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:44,244 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:44,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:44,245 INFO L82 PathProgramCache]: Analyzing trace with hash 999089455, now seen corresponding path program 1 times [2019-09-07 13:02:44,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:44,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:44,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:44,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:44,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-09-07 13:02:44,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:44,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:44,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:44,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:44,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:44,380 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-09-07 13:02:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:44,594 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-09-07 13:02:44,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:44,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-07 13:02:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:44,609 INFO L225 Difference]: With dead ends: 14744 [2019-09-07 13:02:44,610 INFO L226 Difference]: Without dead ends: 7382 [2019-09-07 13:02:44,623 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:44,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-09-07 13:02:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-09-07 13:02:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-09-07 13:02:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-09-07 13:02:44,777 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 316 [2019-09-07 13:02:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:44,778 INFO L475 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-09-07 13:02:44,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-09-07 13:02:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-07 13:02:44,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:44,799 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:44,799 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:44,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:44,800 INFO L82 PathProgramCache]: Analyzing trace with hash -901585188, now seen corresponding path program 1 times [2019-09-07 13:02:44,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:44,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:44,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:44,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:44,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 766 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-07 13:02:44,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:02:44,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:02:45,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:45,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 13:02:45,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:02:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2019-09-07 13:02:45,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:02:45,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-09-07 13:02:45,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:02:45,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:02:45,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:02:45,428 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 7 states. [2019-09-07 13:02:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:46,184 INFO L93 Difference]: Finished difference Result 18408 states and 23982 transitions. [2019-09-07 13:02:46,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:02:46,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 339 [2019-09-07 13:02:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:46,213 INFO L225 Difference]: With dead ends: 18408 [2019-09-07 13:02:46,213 INFO L226 Difference]: Without dead ends: 11034 [2019-09-07 13:02:46,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 341 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:46,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2019-09-07 13:02:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2019-09-07 13:02:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-09-07 13:02:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-09-07 13:02:46,522 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 339 [2019-09-07 13:02:46,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:46,523 INFO L475 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-09-07 13:02:46,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:02:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-09-07 13:02:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-07 13:02:46,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:46,545 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:46,546 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:46,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2002133556, now seen corresponding path program 1 times [2019-09-07 13:02:46,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:46,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:46,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:46,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:46,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-09-07 13:02:46,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:02:46,837 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:46,868 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:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:47,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:02:47,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:02:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-07 13:02:47,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:02:47,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 13:02:47,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:02:47,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:02:47,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:02:47,291 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 5 states. [2019-09-07 13:02:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:47,810 INFO L93 Difference]: Finished difference Result 18174 states and 23220 transitions. [2019-09-07 13:02:47,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:02:47,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 365 [2019-09-07 13:02:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:47,828 INFO L225 Difference]: With dead ends: 18174 [2019-09-07 13:02:47,829 INFO L226 Difference]: Without dead ends: 9724 [2019-09-07 13:02:47,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:02:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9724 states. [2019-09-07 13:02:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9724 to 7985. [2019-09-07 13:02:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7985 states. [2019-09-07 13:02:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7985 states to 7985 states and 9973 transitions. [2019-09-07 13:02:48,025 INFO L78 Accepts]: Start accepts. Automaton has 7985 states and 9973 transitions. Word has length 365 [2019-09-07 13:02:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:48,026 INFO L475 AbstractCegarLoop]: Abstraction has 7985 states and 9973 transitions. [2019-09-07 13:02:48,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:02:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7985 states and 9973 transitions. [2019-09-07 13:02:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-09-07 13:02:48,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:48,039 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:48,039 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:48,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:48,040 INFO L82 PathProgramCache]: Analyzing trace with hash -885260259, now seen corresponding path program 1 times [2019-09-07 13:02:48,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:48,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:48,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:48,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:48,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:48,200 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:48,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:48,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:02:48,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:02:48,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:02:48,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:02:48,202 INFO L87 Difference]: Start difference. First operand 7985 states and 9973 transitions. Second operand 3 states. [2019-09-07 13:02:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:48,515 INFO L93 Difference]: Finished difference Result 15351 states and 18826 transitions. [2019-09-07 13:02:48,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:02:48,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-09-07 13:02:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:48,525 INFO L225 Difference]: With dead ends: 15351 [2019-09-07 13:02:48,526 INFO L226 Difference]: Without dead ends: 3759 [2019-09-07 13:02:48,550 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:48,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2019-09-07 13:02:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3524. [2019-09-07 13:02:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2019-09-07 13:02:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4353 transitions. [2019-09-07 13:02:48,618 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4353 transitions. Word has length 418 [2019-09-07 13:02:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:48,618 INFO L475 AbstractCegarLoop]: Abstraction has 3524 states and 4353 transitions. [2019-09-07 13:02:48,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:02:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4353 transitions. [2019-09-07 13:02:48,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-07 13:02:48,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:48,627 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:48,628 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:48,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:48,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1596843861, now seen corresponding path program 1 times [2019-09-07 13:02:48,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:48,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:48,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:48,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:48,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2019-09-07 13:02:48,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:02:48,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:02:48,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:48,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:02:49,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:02:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-09-07 13:02:49,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:02:49,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 13:02:49,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:02:49,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:02:49,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:02:49,451 INFO L87 Difference]: Start difference. First operand 3524 states and 4353 transitions. Second operand 5 states. [2019-09-07 13:02:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:49,662 INFO L93 Difference]: Finished difference Result 4022 states and 4980 transitions. [2019-09-07 13:02:49,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:02:49,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 502 [2019-09-07 13:02:49,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:49,664 INFO L225 Difference]: With dead ends: 4022 [2019-09-07 13:02:49,664 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 13:02:49,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 504 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:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 13:02:49,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 13:02:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 13:02:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 13:02:49,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 502 [2019-09-07 13:02:49,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:49,669 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 13:02:49,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:02:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 13:02:49,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 13:02:49,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 13:02:50,495 WARN L188 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 102 [2019-09-07 13:02:52,014 WARN L188 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-07 13:02:52,018 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-07 13:02:52,018 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:02:52,019 INFO L446 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2019-09-07 13:02:52,019 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2019-09-07 13:02:52,019 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2019-09-07 13:02:52,019 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2019-09-07 13:02:52,019 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2019-09-07 13:02:52,020 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 515) 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_~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:52,020 INFO L439 ceAbstractionStarter]: At program point L136(lines 132 537) 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:52,021 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2019-09-07 13:02:52,021 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2019-09-07 13:02:52,022 INFO L443 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2019-09-07 13:02:52,022 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2019-09-07 13:02:52,022 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2019-09-07 13:02:52,022 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2019-09-07 13:02:52,022 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2019-09-07 13:02:52,022 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2019-09-07 13:02:52,023 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-09-07 13:02:52,023 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2019-09-07 13:02:52,024 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2019-09-07 13:02:52,024 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2019-09-07 13:02:52,024 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2019-09-07 13:02:52,025 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2019-09-07 13:02:52,026 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 513) 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 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2019-09-07 13:02:52,028 INFO L439 ceAbstractionStarter]: At program point L172(lines 162 527) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-09-07 13:02:52,028 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2019-09-07 13:02:52,028 INFO L443 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2019-09-07 13:02:52,029 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-09-07 13:02:52,029 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-09-07 13:02:52,029 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2019-09-07 13:02:52,029 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2019-09-07 13:02:52,029 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2019-09-07 13:02:52,029 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 85 575) no Hoare annotation was computed. [2019-09-07 13:02:52,029 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2019-09-07 13:02:52,030 INFO L446 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2019-09-07 13:02:52,030 INFO L439 ceAbstractionStarter]: At program point L142(lines 138 535) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-09-07 13:02:52,030 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-07 13:02:52,030 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2019-09-07 13:02:52,030 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2019-09-07 13:02:52,030 INFO L446 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2019-09-07 13:02:52,032 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2019-09-07 13:02:52,032 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2019-09-07 13:02:52,032 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2019-09-07 13:02:52,032 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2019-09-07 13:02:52,033 INFO L443 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2019-09-07 13:02:52,033 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 523) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-09-07 13:02:52,033 INFO L439 ceAbstractionStarter]: At program point L112(lines 111 544) 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:52,033 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2019-09-07 13:02:52,034 INFO L439 ceAbstractionStarter]: At program point L510(lines 108 563) 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 (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (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)))) [2019-09-07 13:02:52,034 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2019-09-07 13:02:52,034 INFO L439 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-09-07 13:02:52,034 INFO L443 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2019-09-07 13:02:52,034 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2019-09-07 13:02:52,034 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2019-09-07 13:02:52,034 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2019-09-07 13:02:52,034 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2019-09-07 13:02:52,035 INFO L439 ceAbstractionStarter]: At program point L148(lines 144 533) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2019-09-07 13:02:52,035 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2019-09-07 13:02:52,035 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2019-09-07 13:02:52,035 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-09-07 13:02:52,035 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-09-07 13:02:52,035 INFO L443 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2019-09-07 13:02:52,035 INFO L443 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2019-09-07 13:02:52,035 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2019-09-07 13:02:52,036 INFO L439 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-09-07 13:02:52,036 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2019-09-07 13:02:52,036 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2019-09-07 13:02:52,036 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2019-09-07 13:02:52,036 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 576) the Hoare annotation is: true [2019-09-07 13:02:52,036 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2019-09-07 13:02:52,036 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2019-09-07 13:02:52,036 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 521) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-09-07 13:02:52,037 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2019-09-07 13:02:52,037 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2019-09-07 13:02:52,037 INFO L443 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2019-09-07 13:02:52,037 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2019-09-07 13:02:52,037 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2019-09-07 13:02:52,037 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2019-09-07 13:02:52,037 INFO L439 ceAbstractionStarter]: At program point L154(lines 150 531) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2019-09-07 13:02:52,037 INFO L443 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2019-09-07 13:02:52,037 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-09-07 13:02:52,038 INFO L443 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2019-09-07 13:02:52,038 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2019-09-07 13:02:52,038 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2019-09-07 13:02:52,038 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2019-09-07 13:02:52,038 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2019-09-07 13:02:52,038 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2019-09-07 13:02:52,040 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 519) 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:52,040 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-09-07 13:02:52,040 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2019-09-07 13:02:52,041 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-09-07 13:02:52,041 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 576) no Hoare annotation was computed. [2019-09-07 13:02:52,041 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2019-09-07 13:02:52,041 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2019-09-07 13:02:52,041 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2019-09-07 13:02:52,041 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2019-09-07 13:02:52,042 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 576) no Hoare annotation was computed. [2019-09-07 13:02:52,042 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2019-09-07 13:02:52,042 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2019-09-07 13:02:52,042 INFO L443 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2019-09-07 13:02:52,042 INFO L439 ceAbstractionStarter]: At program point L160(lines 156 529) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-09-07 13:02:52,043 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2019-09-07 13:02:52,043 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2019-09-07 13:02:52,043 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2019-09-07 13:02:52,043 INFO L443 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2019-09-07 13:02:52,043 INFO L443 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2019-09-07 13:02:52,043 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2019-09-07 13:02:52,044 INFO L443 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2019-09-07 13:02:52,044 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2019-09-07 13:02:52,044 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2019-09-07 13:02:52,044 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2019-09-07 13:02:52,044 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2019-09-07 13:02:52,045 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2019-09-07 13:02:52,045 INFO L443 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2019-09-07 13:02:52,045 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 517) 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:52,045 INFO L439 ceAbstractionStarter]: At program point L130(lines 126 539) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (= ssl3_connect_~s__state~0 4368)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560)))) [2019-09-07 13:02:52,046 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2019-09-07 13:02:52,046 INFO L443 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2019-09-07 13:02:52,046 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2019-09-07 13:02:52,046 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2019-09-07 13:02:52,046 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2019-09-07 13:02:52,046 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2019-09-07 13:02:52,047 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2019-09-07 13:02:52,047 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2019-09-07 13:02:52,047 INFO L443 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2019-09-07 13:02:52,047 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2019-09-07 13:02:52,047 INFO L443 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2019-09-07 13:02:52,047 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:02:52,048 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-07 13:02:52,048 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:02:52,048 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:02:52,048 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 577 587) the Hoare annotation is: true [2019-09-07 13:02:52,048 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 577 587) no Hoare annotation was computed. [2019-09-07 13:02:52,049 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 587) no Hoare annotation was computed. [2019-09-07 13:02:52,049 INFO L439 ceAbstractionStarter]: At program point L583(line 583) the Hoare annotation is: (<= 12292 main_~s~0) [2019-09-07 13:02:52,049 INFO L443 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2019-09-07 13:02:52,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 01:02:52 BoogieIcfgContainer [2019-09-07 13:02:52,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 13:02:52,105 INFO L168 Benchmark]: Toolchain (without parser) took 15775.15 ms. Allocated memory was 142.1 MB in the beginning and 839.4 MB in the end (delta: 697.3 MB). Free memory was 88.6 MB in the beginning and 698.8 MB in the end (delta: -610.2 MB). Peak memory consumption was 613.0 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:52,106 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 142.1 MB. Free memory was 108.2 MB in the beginning and 108.0 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:52,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 558.84 ms. Allocated memory was 142.1 MB in the beginning and 201.3 MB in the end (delta: 59.2 MB). Free memory was 88.4 MB in the beginning and 175.2 MB in the end (delta: -86.8 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:52,110 INFO L168 Benchmark]: Boogie Preprocessor took 54.26 ms. Allocated memory is still 201.3 MB. Free memory was 175.2 MB in the beginning and 172.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:52,112 INFO L168 Benchmark]: RCFGBuilder took 744.98 ms. Allocated memory is still 201.3 MB. Free memory was 172.5 MB in the beginning and 126.0 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:52,114 INFO L168 Benchmark]: TraceAbstraction took 14412.99 ms. Allocated memory was 201.3 MB in the beginning and 839.4 MB in the end (delta: 638.1 MB). Free memory was 126.0 MB in the beginning and 698.8 MB in the end (delta: -572.8 MB). Peak memory consumption was 591.1 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:52,119 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.24 ms. Allocated memory is still 142.1 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 558.84 ms. Allocated memory was 142.1 MB in the beginning and 201.3 MB in the end (delta: 59.2 MB). Free memory was 88.4 MB in the beginning and 175.2 MB in the end (delta: -86.8 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.26 ms. Allocated memory is still 201.3 MB. Free memory was 175.2 MB in the beginning and 172.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 744.98 ms. Allocated memory is still 201.3 MB. Free memory was 172.5 MB in the beginning and 126.0 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14412.99 ms. Allocated memory was 201.3 MB in the beginning and 839.4 MB in the end (delta: 638.1 MB). Free memory was 126.0 MB in the beginning and 698.8 MB in the end (delta: -572.8 MB). Peak memory consumption was 591.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 573]: 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: 162]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 192]: 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: 204]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 108]: 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)) || (blastFlag <= 0 && s__state == 4368)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && 4384 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((4464 == s__state && blastFlag <= 4) && s__hit == 0)) || (((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) - InvariantResult [Line: 186]: 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: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 136 locations, 1 error locations. SAFE Result, 14.2s OverallTime, 24 OverallIterations, 19 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 4900 SDtfs, 1943 SDslu, 3317 SDs, 0 SdLazy, 2728 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1295 GetRequests, 1254 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8460occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 5148 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 240 NumberOfFragments, 700 HoareAnnotationTreeSize, 26 FomulaSimplifications, 16669 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1623 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 6457 NumberOfCodeBlocks, 6457 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6430 ConstructedInterpolants, 0 QuantifiedInterpolants, 3029160 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2267 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 23929/23960 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...