./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4189574b2550552a572f663e591e000dc3f42b46 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 16:09:48,848 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:09:48,850 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:09:48,865 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:09:48,866 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:09:48,867 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:09:48,868 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:09:48,870 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:09:48,872 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:09:48,873 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:09:48,874 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:09:48,875 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:09:48,875 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:09:48,877 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:09:48,878 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:09:48,878 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:09:48,880 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:09:48,882 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:09:48,884 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:09:48,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:09:48,887 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:09:48,888 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:09:48,891 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:09:48,891 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:09:48,891 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:09:48,894 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:09:48,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:09:48,896 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:09:48,898 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:09:48,900 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:09:48,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:09:48,902 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:09:48,902 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:09:48,902 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:09:48,905 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:09:48,906 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:09:48,907 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:09:48,930 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:09:48,930 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:09:48,931 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:09:48,931 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:09:48,932 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:09:48,933 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:09:48,933 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:09:48,933 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:09:48,933 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:09:48,933 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:09:48,934 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:09:48,934 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:09:48,934 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:09:48,935 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:09:48,935 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:09:48,935 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:09:48,935 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:09:48,935 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:09:48,936 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:09:48,936 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:09:48,936 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:09:48,936 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:09:48,936 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:09:48,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:09:48,938 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:09:48,938 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:09:48,938 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:09:48,939 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:09:48,939 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:09:48,939 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:09:48,939 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4189574b2550552a572f663e591e000dc3f42b46 [2018-11-28 16:09:48,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:09:48,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:09:48,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:09:49,001 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:09:49,002 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:09:49,003 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-11-28 16:09:49,075 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39968ddda/1ebaf9445dcb43089de23084ff73f56e/FLAG70c4bf8cf [2018-11-28 16:09:49,645 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:09:49,646 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-11-28 16:09:49,665 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39968ddda/1ebaf9445dcb43089de23084ff73f56e/FLAG70c4bf8cf [2018-11-28 16:09:49,934 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39968ddda/1ebaf9445dcb43089de23084ff73f56e [2018-11-28 16:09:49,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:09:49,940 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:09:49,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:09:49,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:09:49,945 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:09:49,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:09:49" (1/1) ... [2018-11-28 16:09:49,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3926fb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49, skipping insertion in model container [2018-11-28 16:09:49,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:09:49" (1/1) ... [2018-11-28 16:09:49,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:09:50,010 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:09:50,324 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:09:50,329 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:09:50,404 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:09:50,418 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:09:50,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:50 WrapperNode [2018-11-28 16:09:50,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:09:50,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:09:50,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:09:50,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:09:50,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:50" (1/1) ... [2018-11-28 16:09:50,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:50" (1/1) ... [2018-11-28 16:09:50,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:09:50,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:09:50,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:09:50,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:09:50,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:50" (1/1) ... [2018-11-28 16:09:50,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:50" (1/1) ... [2018-11-28 16:09:50,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:50" (1/1) ... [2018-11-28 16:09:50,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:50" (1/1) ... [2018-11-28 16:09:50,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:50" (1/1) ... [2018-11-28 16:09:50,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:50" (1/1) ... [2018-11-28 16:09:50,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:50" (1/1) ... [2018-11-28 16:09:50,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:09:50,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:09:50,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:09:50,566 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:09:50,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:50" (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 [2018-11-28 16:09:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:09:50,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:09:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-28 16:09:50,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-28 16:09:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:09:50,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:09:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:09:50,626 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:09:50,818 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 16:09:50,822 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 16:09:51,796 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:09:51,797 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:09:51,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:09:51 BoogieIcfgContainer [2018-11-28 16:09:51,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:09:51,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:09:51,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:09:51,802 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:09:51,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:09:49" (1/3) ... [2018-11-28 16:09:51,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:09:51, skipping insertion in model container [2018-11-28 16:09:51,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:50" (2/3) ... [2018-11-28 16:09:51,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:09:51, skipping insertion in model container [2018-11-28 16:09:51,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:09:51" (3/3) ... [2018-11-28 16:09:51,805 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-11-28 16:09:51,815 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:09:51,824 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:09:51,839 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:09:51,872 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:09:51,873 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:09:51,873 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:09:51,873 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:09:51,874 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:09:51,874 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:09:51,874 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:09:51,874 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:09:51,874 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:09:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-11-28 16:09:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 16:09:51,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:51,904 INFO L402 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] [2018-11-28 16:09:51,907 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:51,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:51,912 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2018-11-28 16:09:51,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:51,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:51,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:51,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:51,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:09:52,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:52,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:52,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:52,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:52,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:52,215 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-11-28 16:09:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:52,582 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-11-28 16:09:52,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:52,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 16:09:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:52,601 INFO L225 Difference]: With dead ends: 377 [2018-11-28 16:09:52,601 INFO L226 Difference]: Without dead ends: 220 [2018-11-28 16:09:52,611 INFO L631 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 [2018-11-28 16:09:52,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-28 16:09:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-11-28 16:09:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-28 16:09:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-11-28 16:09:52,682 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2018-11-28 16:09:52,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:52,682 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-11-28 16:09:52,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-11-28 16:09:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 16:09:52,686 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:52,686 INFO L402 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] [2018-11-28 16:09:52,687 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:52,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:52,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2018-11-28 16:09:52,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:52,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:52,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:52,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:52,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:09:52,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:52,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:52,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:52,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:52,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:52,804 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-11-28 16:09:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:53,259 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2018-11-28 16:09:53,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:53,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-28 16:09:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:53,263 INFO L225 Difference]: With dead ends: 470 [2018-11-28 16:09:53,263 INFO L226 Difference]: Without dead ends: 262 [2018-11-28 16:09:53,266 INFO L631 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 [2018-11-28 16:09:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-28 16:09:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2018-11-28 16:09:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-28 16:09:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2018-11-28 16:09:53,290 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2018-11-28 16:09:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:53,291 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2018-11-28 16:09:53,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2018-11-28 16:09:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 16:09:53,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:53,295 INFO L402 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] [2018-11-28 16:09:53,295 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:53,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:53,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1578262845, now seen corresponding path program 1 times [2018-11-28 16:09:53,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:53,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:53,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:53,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:53,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 16:09:53,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:53,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:53,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:53,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:53,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:53,457 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2018-11-28 16:09:54,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:54,213 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-11-28 16:09:54,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:54,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-28 16:09:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:54,219 INFO L225 Difference]: With dead ends: 598 [2018-11-28 16:09:54,219 INFO L226 Difference]: Without dead ends: 354 [2018-11-28 16:09:54,222 INFO L631 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 [2018-11-28 16:09:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-28 16:09:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2018-11-28 16:09:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-28 16:09:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2018-11-28 16:09:54,247 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2018-11-28 16:09:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:54,248 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2018-11-28 16:09:54,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2018-11-28 16:09:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 16:09:54,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:54,252 INFO L402 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] [2018-11-28 16:09:54,252 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:54,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:54,253 INFO L82 PathProgramCache]: Analyzing trace with hash -227175489, now seen corresponding path program 1 times [2018-11-28 16:09:54,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:54,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:54,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:54,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:54,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 16:09:54,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:54,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:54,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:54,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:54,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:54,347 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2018-11-28 16:09:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:54,599 INFO L93 Difference]: Finished difference Result 710 states and 1008 transitions. [2018-11-28 16:09:54,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:54,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-28 16:09:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:54,604 INFO L225 Difference]: With dead ends: 710 [2018-11-28 16:09:54,604 INFO L226 Difference]: Without dead ends: 386 [2018-11-28 16:09:54,606 INFO L631 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 [2018-11-28 16:09:54,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-11-28 16:09:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 374. [2018-11-28 16:09:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-28 16:09:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-11-28 16:09:54,625 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2018-11-28 16:09:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:54,626 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-11-28 16:09:54,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-11-28 16:09:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 16:09:54,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:54,631 INFO L402 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] [2018-11-28 16:09:54,631 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:54,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:54,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1103228957, now seen corresponding path program 1 times [2018-11-28 16:09:54,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:54,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:54,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:54,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:54,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 16:09:54,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:54,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:54,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:54,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:54,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:54,747 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-11-28 16:09:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:55,112 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2018-11-28 16:09:55,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:55,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-11-28 16:09:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:55,116 INFO L225 Difference]: With dead ends: 842 [2018-11-28 16:09:55,116 INFO L226 Difference]: Without dead ends: 478 [2018-11-28 16:09:55,118 INFO L631 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 [2018-11-28 16:09:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-11-28 16:09:55,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2018-11-28 16:09:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-11-28 16:09:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2018-11-28 16:09:55,138 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2018-11-28 16:09:55,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:55,138 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2018-11-28 16:09:55,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2018-11-28 16:09:55,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 16:09:55,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:55,145 INFO L402 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] [2018-11-28 16:09:55,145 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:55,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:55,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1629529054, now seen corresponding path program 1 times [2018-11-28 16:09:55,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:55,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:55,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:55,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:55,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 16:09:55,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:55,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:55,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:55,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:55,300 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2018-11-28 16:09:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:55,567 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2018-11-28 16:09:55,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:55,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-28 16:09:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:55,574 INFO L225 Difference]: With dead ends: 940 [2018-11-28 16:09:55,575 INFO L226 Difference]: Without dead ends: 500 [2018-11-28 16:09:55,576 INFO L631 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 [2018-11-28 16:09:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-11-28 16:09:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2018-11-28 16:09:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-11-28 16:09:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2018-11-28 16:09:55,598 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2018-11-28 16:09:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:55,599 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2018-11-28 16:09:55,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2018-11-28 16:09:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 16:09:55,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:55,605 INFO L402 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] [2018-11-28 16:09:55,605 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:55,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:55,606 INFO L82 PathProgramCache]: Analyzing trace with hash -233915046, now seen corresponding path program 1 times [2018-11-28 16:09:55,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:55,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:55,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:55,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:55,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 16:09:55,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:55,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:55,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:55,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:55,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:55,752 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2018-11-28 16:09:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:56,084 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2018-11-28 16:09:56,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:56,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-11-28 16:09:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:56,090 INFO L225 Difference]: With dead ends: 976 [2018-11-28 16:09:56,090 INFO L226 Difference]: Without dead ends: 734 [2018-11-28 16:09:56,091 INFO L631 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 [2018-11-28 16:09:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-11-28 16:09:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-11-28 16:09:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-28 16:09:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2018-11-28 16:09:56,119 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2018-11-28 16:09:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:56,119 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2018-11-28 16:09:56,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2018-11-28 16:09:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 16:09:56,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:56,124 INFO L402 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] [2018-11-28 16:09:56,124 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:56,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:56,124 INFO L82 PathProgramCache]: Analyzing trace with hash -674483159, now seen corresponding path program 1 times [2018-11-28 16:09:56,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:56,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:56,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:56,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:56,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-28 16:09:56,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:56,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:56,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:56,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:56,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:56,266 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2018-11-28 16:09:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:56,609 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2018-11-28 16:09:56,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:56,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-28 16:09:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:56,618 INFO L225 Difference]: With dead ends: 976 [2018-11-28 16:09:56,618 INFO L226 Difference]: Without dead ends: 974 [2018-11-28 16:09:56,619 INFO L631 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 [2018-11-28 16:09:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-11-28 16:09:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2018-11-28 16:09:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-11-28 16:09:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2018-11-28 16:09:56,656 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2018-11-28 16:09:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:56,656 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2018-11-28 16:09:56,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2018-11-28 16:09:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-28 16:09:56,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:56,665 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:09:56,665 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:56,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:56,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2095197958, now seen corresponding path program 1 times [2018-11-28 16:09:56,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:56,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:56,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:56,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:56,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-28 16:09:56,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:56,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:56,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:56,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:56,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:56,782 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2018-11-28 16:09:58,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:58,279 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2018-11-28 16:09:58,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:58,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-11-28 16:09:58,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:58,288 INFO L225 Difference]: With dead ends: 2140 [2018-11-28 16:09:58,289 INFO L226 Difference]: Without dead ends: 1170 [2018-11-28 16:09:58,291 INFO L631 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 [2018-11-28 16:09:58,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-11-28 16:09:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2018-11-28 16:09:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-11-28 16:09:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2018-11-28 16:09:58,328 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 139 [2018-11-28 16:09:58,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:58,329 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2018-11-28 16:09:58,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:58,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2018-11-28 16:09:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-28 16:09:58,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:58,334 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:09:58,334 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:58,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:58,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2111242741, now seen corresponding path program 1 times [2018-11-28 16:09:58,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:58,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:58,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:58,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:58,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-28 16:09:58,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:58,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:58,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:58,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:58,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:58,454 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2018-11-28 16:09:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:59,799 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2018-11-28 16:09:59,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:59,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-11-28 16:09:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:59,807 INFO L225 Difference]: With dead ends: 2354 [2018-11-28 16:09:59,808 INFO L226 Difference]: Without dead ends: 1236 [2018-11-28 16:09:59,811 INFO L631 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 [2018-11-28 16:09:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-11-28 16:09:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2018-11-28 16:09:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-11-28 16:09:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2018-11-28 16:09:59,854 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 175 [2018-11-28 16:09:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:59,854 INFO L480 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2018-11-28 16:09:59,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2018-11-28 16:09:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-28 16:09:59,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:59,860 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:09:59,860 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:59,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:59,861 INFO L82 PathProgramCache]: Analyzing trace with hash 834252520, now seen corresponding path program 1 times [2018-11-28 16:09:59,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:59,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:59,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:59,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:59,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-28 16:09:59,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:59,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:59,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:59,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:59,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:59,979 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2018-11-28 16:10:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:00,591 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2018-11-28 16:10:00,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:00,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2018-11-28 16:10:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:00,606 INFO L225 Difference]: With dead ends: 2544 [2018-11-28 16:10:00,606 INFO L226 Difference]: Without dead ends: 1334 [2018-11-28 16:10:00,610 INFO L631 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 [2018-11-28 16:10:00,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-11-28 16:10:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2018-11-28 16:10:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-11-28 16:10:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2018-11-28 16:10:00,648 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 196 [2018-11-28 16:10:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:00,648 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2018-11-28 16:10:00,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2018-11-28 16:10:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-28 16:10:00,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:00,654 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:00,654 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:00,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:00,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1654542421, now seen corresponding path program 1 times [2018-11-28 16:10:00,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:00,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:00,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-11-28 16:10:00,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:00,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:00,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:00,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:00,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:00,792 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2018-11-28 16:10:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:01,165 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2018-11-28 16:10:01,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:01,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-11-28 16:10:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:01,183 INFO L225 Difference]: With dead ends: 2752 [2018-11-28 16:10:01,183 INFO L226 Difference]: Without dead ends: 1442 [2018-11-28 16:10:01,187 INFO L631 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 [2018-11-28 16:10:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-11-28 16:10:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2018-11-28 16:10:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-11-28 16:10:01,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2018-11-28 16:10:01,233 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 220 [2018-11-28 16:10:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:01,234 INFO L480 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2018-11-28 16:10:01,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2018-11-28 16:10:01,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-28 16:10:01,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:01,241 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:01,241 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:01,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:01,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1609383977, now seen corresponding path program 1 times [2018-11-28 16:10:01,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:01,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:01,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:01,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:01,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-11-28 16:10:01,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:01,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:01,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:01,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:01,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:01,450 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2018-11-28 16:10:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:02,268 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2018-11-28 16:10:02,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:02,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-11-28 16:10:02,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:02,277 INFO L225 Difference]: With dead ends: 2992 [2018-11-28 16:10:02,278 INFO L226 Difference]: Without dead ends: 1570 [2018-11-28 16:10:02,281 INFO L631 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 [2018-11-28 16:10:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-11-28 16:10:02,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2018-11-28 16:10:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-28 16:10:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2018-11-28 16:10:02,320 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 220 [2018-11-28 16:10:02,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:02,321 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2018-11-28 16:10:02,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2018-11-28 16:10:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-28 16:10:02,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:02,328 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:02,328 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:02,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:02,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1500640469, now seen corresponding path program 1 times [2018-11-28 16:10:02,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:02,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:02,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:02,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:02,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-28 16:10:02,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:02,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:02,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:02,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:02,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:02,466 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2018-11-28 16:10:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:02,541 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2018-11-28 16:10:02,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:02,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-11-28 16:10:02,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:02,557 INFO L225 Difference]: With dead ends: 4646 [2018-11-28 16:10:02,557 INFO L226 Difference]: Without dead ends: 3100 [2018-11-28 16:10:02,562 INFO L631 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 [2018-11-28 16:10:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-11-28 16:10:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2018-11-28 16:10:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-11-28 16:10:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2018-11-28 16:10:02,637 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 250 [2018-11-28 16:10:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:02,637 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2018-11-28 16:10:02,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2018-11-28 16:10:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-28 16:10:02,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:02,647 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:02,647 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:02,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:02,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1763285929, now seen corresponding path program 1 times [2018-11-28 16:10:02,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:02,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:02,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:02,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:02,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-28 16:10:02,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:02,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:02,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:02,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:02,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:02,789 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2018-11-28 16:10:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:03,244 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2018-11-28 16:10:03,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:03,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-11-28 16:10:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:03,262 INFO L225 Difference]: With dead ends: 6484 [2018-11-28 16:10:03,262 INFO L226 Difference]: Without dead ends: 3398 [2018-11-28 16:10:03,269 INFO L631 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 [2018-11-28 16:10:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-11-28 16:10:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2018-11-28 16:10:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2018-11-28 16:10:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2018-11-28 16:10:03,342 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 250 [2018-11-28 16:10:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:03,342 INFO L480 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2018-11-28 16:10:03,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2018-11-28 16:10:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-28 16:10:03,352 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:03,352 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:03,353 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:03,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:03,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1165577599, now seen corresponding path program 1 times [2018-11-28 16:10:03,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:03,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:03,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:03,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:03,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2018-11-28 16:10:03,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:03,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:03,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:03,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:03,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:03,576 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2018-11-28 16:10:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:04,153 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2018-11-28 16:10:04,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:04,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2018-11-28 16:10:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:04,170 INFO L225 Difference]: With dead ends: 6900 [2018-11-28 16:10:04,170 INFO L226 Difference]: Without dead ends: 3530 [2018-11-28 16:10:04,178 INFO L631 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 [2018-11-28 16:10:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2018-11-28 16:10:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2018-11-28 16:10:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-11-28 16:10:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2018-11-28 16:10:04,249 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 274 [2018-11-28 16:10:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:04,250 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2018-11-28 16:10:04,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2018-11-28 16:10:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-28 16:10:04,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:04,259 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:04,260 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:04,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:04,260 INFO L82 PathProgramCache]: Analyzing trace with hash -373875199, now seen corresponding path program 1 times [2018-11-28 16:10:04,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:04,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:04,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:04,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:04,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-11-28 16:10:04,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:04,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:04,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:04,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:04,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:04,411 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2018-11-28 16:10:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:05,173 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2018-11-28 16:10:05,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:05,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-11-28 16:10:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:05,195 INFO L225 Difference]: With dead ends: 7416 [2018-11-28 16:10:05,196 INFO L226 Difference]: Without dead ends: 3914 [2018-11-28 16:10:05,203 INFO L631 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 [2018-11-28 16:10:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2018-11-28 16:10:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2018-11-28 16:10:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-11-28 16:10:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2018-11-28 16:10:05,279 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 285 [2018-11-28 16:10:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:05,280 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2018-11-28 16:10:05,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2018-11-28 16:10:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-11-28 16:10:05,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:05,291 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:05,291 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:05,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:05,292 INFO L82 PathProgramCache]: Analyzing trace with hash -233584477, now seen corresponding path program 1 times [2018-11-28 16:10:05,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:05,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:05,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:05,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:05,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-28 16:10:05,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:05,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:05,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:05,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:05,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:05,436 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2018-11-28 16:10:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:06,029 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2018-11-28 16:10:06,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:06,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2018-11-28 16:10:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:06,062 INFO L225 Difference]: With dead ends: 8048 [2018-11-28 16:10:06,069 INFO L226 Difference]: Without dead ends: 4234 [2018-11-28 16:10:06,075 INFO L631 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 [2018-11-28 16:10:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2018-11-28 16:10:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2018-11-28 16:10:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-11-28 16:10:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2018-11-28 16:10:06,165 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 299 [2018-11-28 16:10:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:06,165 INFO L480 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2018-11-28 16:10:06,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2018-11-28 16:10:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-28 16:10:06,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:06,176 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:06,176 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:06,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:06,176 INFO L82 PathProgramCache]: Analyzing trace with hash -110745964, now seen corresponding path program 1 times [2018-11-28 16:10:06,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:06,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:06,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:06,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:06,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2018-11-28 16:10:06,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:06,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:06,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:06,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:06,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:06,395 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2018-11-28 16:10:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:06,493 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2018-11-28 16:10:06,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:06,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-11-28 16:10:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:06,510 INFO L225 Difference]: With dead ends: 11310 [2018-11-28 16:10:06,511 INFO L226 Difference]: Without dead ends: 7376 [2018-11-28 16:10:06,519 INFO L631 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 [2018-11-28 16:10:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2018-11-28 16:10:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2018-11-28 16:10:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2018-11-28 16:10:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2018-11-28 16:10:06,647 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 300 [2018-11-28 16:10:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:06,647 INFO L480 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2018-11-28 16:10:06,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2018-11-28 16:10:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-11-28 16:10:06,660 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:06,661 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:06,661 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:06,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash 123119806, now seen corresponding path program 1 times [2018-11-28 16:10:06,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:06,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:06,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2018-11-28 16:10:06,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:06,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:06,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:06,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:06,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:06,807 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2018-11-28 16:10:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:07,634 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2018-11-28 16:10:07,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:07,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2018-11-28 16:10:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:07,650 INFO L225 Difference]: With dead ends: 14744 [2018-11-28 16:10:07,650 INFO L226 Difference]: Without dead ends: 7382 [2018-11-28 16:10:07,662 INFO L631 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 [2018-11-28 16:10:07,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2018-11-28 16:10:07,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2018-11-28 16:10:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2018-11-28 16:10:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2018-11-28 16:10:07,796 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 301 [2018-11-28 16:10:07,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:07,797 INFO L480 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2018-11-28 16:10:07,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:07,797 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2018-11-28 16:10:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-11-28 16:10:07,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:07,810 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:07,810 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:07,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:07,811 INFO L82 PathProgramCache]: Analyzing trace with hash -994522767, now seen corresponding path program 1 times [2018-11-28 16:10:07,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:07,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:07,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:07,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:07,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 637 proven. 14 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-11-28 16:10:08,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:10:08,144 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 [2018-11-28 16:10:08,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:08,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:10:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2018-11-28 16:10:08,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:10:08,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-11-28 16:10:08,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 16:10:08,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 16:10:08,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:10:08,549 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 7 states. [2018-11-28 16:10:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:11,398 INFO L93 Difference]: Finished difference Result 18408 states and 23982 transitions. [2018-11-28 16:10:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 16:10:11,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 324 [2018-11-28 16:10:11,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:11,424 INFO L225 Difference]: With dead ends: 18408 [2018-11-28 16:10:11,424 INFO L226 Difference]: Without dead ends: 11034 [2018-11-28 16:10:11,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-28 16:10:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2018-11-28 16:10:11,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2018-11-28 16:10:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2018-11-28 16:10:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2018-11-28 16:10:11,665 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 324 [2018-11-28 16:10:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:11,666 INFO L480 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2018-11-28 16:10:11,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 16:10:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2018-11-28 16:10:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-28 16:10:11,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:11,680 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:11,680 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:11,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:11,680 INFO L82 PathProgramCache]: Analyzing trace with hash 233855425, now seen corresponding path program 1 times [2018-11-28 16:10:11,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:11,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:11,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 714 proven. 5 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2018-11-28 16:10:11,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:10:11,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:10:11,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:12,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:10:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2018-11-28 16:10:12,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:10:12,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-28 16:10:12,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 16:10:12,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 16:10:12,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:10:12,344 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 5 states. [2018-11-28 16:10:13,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:13,678 INFO L93 Difference]: Finished difference Result 18172 states and 23218 transitions. [2018-11-28 16:10:13,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 16:10:13,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 350 [2018-11-28 16:10:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:13,698 INFO L225 Difference]: With dead ends: 18172 [2018-11-28 16:10:13,698 INFO L226 Difference]: Without dead ends: 9722 [2018-11-28 16:10:13,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:10:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9722 states. [2018-11-28 16:10:13,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9722 to 7983. [2018-11-28 16:10:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7983 states. [2018-11-28 16:10:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 9971 transitions. [2018-11-28 16:10:13,895 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 9971 transitions. Word has length 350 [2018-11-28 16:10:13,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:13,896 INFO L480 AbstractCegarLoop]: Abstraction has 7983 states and 9971 transitions. [2018-11-28 16:10:13,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 16:10:13,896 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 9971 transitions. [2018-11-28 16:10:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-11-28 16:10:13,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:13,912 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:13,912 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:13,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:13,913 INFO L82 PathProgramCache]: Analyzing trace with hash 675475598, now seen corresponding path program 1 times [2018-11-28 16:10:13,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:13,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:13,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:13,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:13,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-11-28 16:10:14,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:14,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:14,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:14,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:14,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:14,111 INFO L87 Difference]: Start difference. First operand 7983 states and 9971 transitions. Second operand 3 states. [2018-11-28 16:10:14,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:14,797 INFO L93 Difference]: Finished difference Result 15357 states and 18836 transitions. [2018-11-28 16:10:14,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:14,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2018-11-28 16:10:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:14,806 INFO L225 Difference]: With dead ends: 15357 [2018-11-28 16:10:14,807 INFO L226 Difference]: Without dead ends: 3807 [2018-11-28 16:10:14,824 INFO L631 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 [2018-11-28 16:10:14,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2018-11-28 16:10:14,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 3549. [2018-11-28 16:10:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2018-11-28 16:10:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 4386 transitions. [2018-11-28 16:10:14,906 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 4386 transitions. Word has length 420 [2018-11-28 16:10:14,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:14,906 INFO L480 AbstractCegarLoop]: Abstraction has 3549 states and 4386 transitions. [2018-11-28 16:10:14,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4386 transitions. [2018-11-28 16:10:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-11-28 16:10:14,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:14,921 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:14,921 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:14,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash 331734252, now seen corresponding path program 1 times [2018-11-28 16:10:14,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:14,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:14,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:14,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:14,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-11-28 16:10:15,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:10:15,333 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 [2018-11-28 16:10:15,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:15,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:10:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-11-28 16:10:15,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:10:15,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 16:10:15,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 16:10:15,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 16:10:15,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 16:10:15,568 INFO L87 Difference]: Start difference. First operand 3549 states and 4386 transitions. Second operand 4 states. [2018-11-28 16:10:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:15,763 INFO L93 Difference]: Finished difference Result 4045 states and 5011 transitions. [2018-11-28 16:10:15,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 16:10:15,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 487 [2018-11-28 16:10:15,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:15,765 INFO L225 Difference]: With dead ends: 4045 [2018-11-28 16:10:15,765 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:10:15,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:10:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:10:15,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:10:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:10:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:10:15,774 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 487 [2018-11-28 16:10:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:15,775 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:10:15,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 16:10:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:10:15,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:10:15,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:10:15,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,514 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 390 DAG size of output: 100 [2018-11-28 16:10:16,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:16,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:17,212 WARN L180 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-11-28 16:10:17,586 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-11-28 16:10:17,760 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-11-28 16:10:18,918 WARN L180 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2018-11-28 16:10:18,969 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:10:18,970 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:18,970 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-11-28 16:10:18,970 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-11-28 16:10:18,970 INFO L451 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-11-28 16:10:18,970 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-11-28 16:10:18,970 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-11-28 16:10:18,971 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-11-28 16:10:18,971 INFO L444 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-11-28 16:10:18,971 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2018-11-28 16:10:18,971 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-11-28 16:10:18,971 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-11-28 16:10:18,971 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-11-28 16:10:18,971 INFO L448 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-11-28 16:10:18,971 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-11-28 16:10:18,971 INFO L448 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-11-28 16:10:18,972 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-11-28 16:10:18,972 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-11-28 16:10:18,972 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-11-28 16:10:18,972 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-11-28 16:10:18,972 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-11-28 16:10:18,972 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-11-28 16:10:18,972 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-11-28 16:10:18,972 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 16:10:18,972 INFO L448 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-11-28 16:10:18,972 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-28 16:10:18,972 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-11-28 16:10:18,973 INFO L444 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0)) [2018-11-28 16:10:18,974 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-11-28 16:10:18,974 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-11-28 16:10:18,974 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-11-28 16:10:18,974 INFO L444 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-11-28 16:10:18,974 INFO L448 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-11-28 16:10:18,974 INFO L448 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-11-28 16:10:18,974 INFO L451 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-11-28 16:10:18,974 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-11-28 16:10:18,974 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-11-28 16:10:18,974 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-11-28 16:10:18,975 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2018-11-28 16:10:18,975 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-11-28 16:10:18,975 INFO L448 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-11-28 16:10:18,975 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-11-28 16:10:18,975 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-11-28 16:10:18,975 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-11-28 16:10:18,975 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-11-28 16:10:18,975 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-11-28 16:10:18,975 INFO L448 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-11-28 16:10:18,975 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-11-28 16:10:18,975 INFO L448 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-11-28 16:10:18,975 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-11-28 16:10:18,978 INFO L444 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (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))) [2018-11-28 16:10:18,978 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-11-28 16:10:18,978 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-11-28 16:10:18,978 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-11-28 16:10:18,978 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-11-28 16:10:18,978 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-11-28 16:10:18,978 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-11-28 16:10:18,978 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-11-28 16:10:18,978 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-28 16:10:18,978 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2018-11-28 16:10:18,978 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-11-28 16:10:18,979 INFO L448 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2018-11-28 16:10:18,979 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 505) 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 (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-11-28 16:10:18,979 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-11-28 16:10:18,979 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-11-28 16:10:18,979 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2018-11-28 16:10:18,979 INFO L448 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 16:10:18,979 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-11-28 16:10:18,979 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-11-28 16:10:18,979 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-11-28 16:10:18,979 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-11-28 16:10:18,979 INFO L444 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (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))) [2018-11-28 16:10:18,980 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (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)))) [2018-11-28 16:10:18,980 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-11-28 16:10:18,980 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-11-28 16:10:18,980 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-11-28 16:10:18,980 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-11-28 16:10:18,980 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2018-11-28 16:10:18,980 INFO L444 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse9 (= ssl3_connect_~s__state~0 4448)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse14 (<= ssl3_connect_~s__state~0 4352)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1) (and .cse3 .cse9 .cse1) (and .cse5 .cse0 .cse1) (and .cse10 .cse6 .cse1) (and .cse11 .cse0 .cse1) (and .cse6 .cse5) (and .cse3 .cse12 .cse1) (and .cse3 .cse7 .cse1 .cse8 .cse13) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse10 .cse3) (and .cse3 .cse1 .cse2) (and .cse6 .cse12) (and .cse11 .cse3 .cse1) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse6 (= ssl3_connect_~s__state~0 4384)) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse14 .cse15) (and (= ssl3_connect_~s__state~0 4416) .cse0 .cse1) (and .cse12 .cse0 .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and .cse3 .cse14 .cse15 .cse1 .cse13) (and .cse4 .cse0 .cse1) (and .cse6 (= ssl3_connect_~s__state~0 4400) .cse1))) [2018-11-28 16:10:18,980 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-11-28 16:10:18,981 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-11-28 16:10:18,981 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-11-28 16:10:18,981 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-11-28 16:10:18,981 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-11-28 16:10:18,981 INFO L444 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-11-28 16:10:18,981 INFO L448 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 16:10:18,981 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-11-28 16:10:18,981 INFO L448 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 16:10:18,981 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-11-28 16:10:18,981 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-11-28 16:10:18,981 INFO L448 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2018-11-28 16:10:18,982 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-11-28 16:10:18,983 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-11-28 16:10:18,983 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-11-28 16:10:18,983 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-11-28 16:10:18,983 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-11-28 16:10:18,983 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-11-28 16:10:18,983 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-11-28 16:10:18,983 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-11-28 16:10:18,984 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-11-28 16:10:18,984 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-11-28 16:10:18,984 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-11-28 16:10:18,984 INFO L448 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-11-28 16:10:18,984 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-11-28 16:10:18,984 INFO L444 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (= ssl3_connect_~s__hit~0 0) .cse1 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2018-11-28 16:10:18,984 INFO L444 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-28 16:10:18,984 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-11-28 16:10:18,984 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-11-28 16:10:18,984 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-11-28 16:10:18,985 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-11-28 16:10:18,985 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-11-28 16:10:18,985 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-11-28 16:10:18,985 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-11-28 16:10:18,985 INFO L448 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-11-28 16:10:18,985 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-11-28 16:10:18,985 INFO L444 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1))) [2018-11-28 16:10:18,985 INFO L444 ceAbstractionStarter]: At program point L163(lines 153 503) 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 (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) .cse2))) [2018-11-28 16:10:18,985 INFO L448 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-11-28 16:10:18,986 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-11-28 16:10:18,994 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-11-28 16:10:18,994 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-11-28 16:10:18,994 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2018-11-28 16:10:18,994 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-11-28 16:10:18,994 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-11-28 16:10:18,994 INFO L444 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-28 16:10:18,994 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-28 16:10:18,994 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-11-28 16:10:18,995 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-11-28 16:10:18,995 INFO L448 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 16:10:18,995 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:18,995 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:10:18,995 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:10:18,995 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:10:18,995 INFO L444 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2018-11-28 16:10:18,995 INFO L448 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-11-28 16:10:18,995 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-11-28 16:10:18,995 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-11-28 16:10:18,995 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-11-28 16:10:19,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:10:19 BoogieIcfgContainer [2018-11-28 16:10:19,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:10:19,045 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:10:19,045 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:10:19,045 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:10:19,046 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:09:51" (3/4) ... [2018-11-28 16:10:19,053 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:10:19,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:10:19,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-28 16:10:19,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:10:19,083 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-28 16:10:19,083 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 16:10:19,084 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:10:19,118 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-11-28 16:10:19,118 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-11-28 16:10:19,119 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) [2018-11-28 16:10:19,119 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-11-28 16:10:19,120 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-11-28 16:10:19,120 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 [2018-11-28 16:10:19,120 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && 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)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((((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 <= 2 && s__state == 4400) && s__hit == 0) [2018-11-28 16:10:19,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-28 16:10:19,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((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) [2018-11-28 16:10:19,125 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-11-28 16:10:19,125 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-11-28 16:10:19,126 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((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) [2018-11-28 16:10:19,126 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((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) [2018-11-28 16:10:19,126 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((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) [2018-11-28 16:10:19,126 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((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) [2018-11-28 16:10:19,126 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) [2018-11-28 16:10:19,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((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) [2018-11-28 16:10:19,237 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:10:19,241 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:10:19,242 INFO L168 Benchmark]: Toolchain (without parser) took 29303.11 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 758.6 MB). Free memory was 946.0 MB in the beginning and 1.6 GB in the end (delta: -629.0 MB). Peak memory consumption was 129.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:19,244 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:19,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.25 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 928.5 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:19,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.19 ms. Allocated memory is still 1.0 GB. Free memory is still 928.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:19,245 INFO L168 Benchmark]: Boogie Preprocessor took 117.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:19,245 INFO L168 Benchmark]: RCFGBuilder took 1231.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:19,245 INFO L168 Benchmark]: TraceAbstraction took 27246.54 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 640.7 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -515.2 MB). Peak memory consumption was 770.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:19,249 INFO L168 Benchmark]: Witness Printer took 196.14 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-28 16:10:19,251 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 478.25 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 928.5 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.19 ms. Allocated memory is still 1.0 GB. Free memory is still 928.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1231.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27246.54 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 640.7 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -515.2 MB). Peak memory consumption was 770.7 MB. Max. memory is 11.5 GB. * Witness Printer took 196.14 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((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: 177]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || blastFlag <= 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && 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)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((((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 <= 2 && s__state == 4400) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 138 locations, 1 error locations. SAFE Result, 27.1s OverallTime, 24 OverallIterations, 18 TraceHistogramMax, 16.7s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4880 SDtfs, 1922 SDslu, 3221 SDs, 0 SdLazy, 2713 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1248 GetRequests, 1209 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.8s 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.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 5171 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 236 NumberOfFragments, 656 HoareAnnotationTreeSize, 26 FomulaSimplifications, 16403 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1648 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 6189 NumberOfCodeBlocks, 6189 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6162 ConstructedInterpolants, 0 QuantifiedInterpolants, 2319388 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2159 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 21338/21385 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...