./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer --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.23-635dfa2 [2018-12-09 09:56:16,959 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:56:16,960 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:56:16,966 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:56:16,967 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:56:16,967 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:56:16,968 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:56:16,969 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:56:16,969 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:56:16,970 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:56:16,970 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:56:16,971 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:56:16,971 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:56:16,972 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:56:16,972 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:56:16,973 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:56:16,973 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:56:16,974 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:56:16,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:56:16,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:56:16,976 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:56:16,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:56:16,978 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:56:16,978 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:56:16,978 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:56:16,979 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:56:16,979 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:56:16,980 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:56:16,980 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:56:16,981 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:56:16,981 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:56:16,981 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:56:16,981 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:56:16,982 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:56:16,982 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:56:16,982 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:56:16,983 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 09:56:16,990 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:56:16,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:56:16,991 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:56:16,991 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:56:16,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:56:16,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:56:16,991 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 09:56:16,991 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:56:16,991 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:56:16,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:56:16,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:56:16,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:56:16,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:56:16,992 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:56:16,992 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:56:16,992 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:56:16,992 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:56:16,993 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 09:56:16,993 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:56:16,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:56:16,993 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:56:16,993 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:56:16,993 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:56:16,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:56:16,993 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:56:16,993 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:56:16,994 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:56:16,994 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 09:56:16,994 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:56:16,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:56:16,994 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer 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-12-09 09:56:17,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:56:17,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:56:17,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:56:17,021 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:56:17,022 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:56:17,022 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-12-09 09:56:17,057 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/data/840fc36e8/76c73f9ef94e428c95128e022cde5003/FLAG07b519c60 [2018-12-09 09:56:17,456 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:56:17,456 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-12-09 09:56:17,461 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/data/840fc36e8/76c73f9ef94e428c95128e022cde5003/FLAG07b519c60 [2018-12-09 09:56:17,809 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/data/840fc36e8/76c73f9ef94e428c95128e022cde5003 [2018-12-09 09:56:17,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:56:17,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:56:17,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:56:17,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:56:17,821 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:56:17,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:56:17" (1/1) ... [2018-12-09 09:56:17,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9d2c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:56:17, skipping insertion in model container [2018-12-09 09:56:17,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:56:17" (1/1) ... [2018-12-09 09:56:17,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:56:17,852 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:56:17,974 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:56:17,976 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:56:18,006 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:56:18,045 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:56:18,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:56:18 WrapperNode [2018-12-09 09:56:18,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:56:18,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:56:18,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:56:18,046 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:56:18,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:56:18" (1/1) ... [2018-12-09 09:56:18,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:56:18" (1/1) ... [2018-12-09 09:56:18,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:56:18,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:56:18,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:56:18,062 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:56:18,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:56:18" (1/1) ... [2018-12-09 09:56:18,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:56:18" (1/1) ... [2018-12-09 09:56:18,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:56:18" (1/1) ... [2018-12-09 09:56:18,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:56:18" (1/1) ... [2018-12-09 09:56:18,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:56:18" (1/1) ... [2018-12-09 09:56:18,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:56:18" (1/1) ... [2018-12-09 09:56:18,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:56:18" (1/1) ... [2018-12-09 09:56:18,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:56:18,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:56:18,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:56:18,092 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:56:18,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:56:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/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-12-09 09:56:18,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:56:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:56:18,124 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-09 09:56:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-09 09:56:18,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:56:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:56:18,124 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:56:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:56:18,195 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 09:56:18,195 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 09:56:18,409 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:56:18,410 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 09:56:18,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:56:18 BoogieIcfgContainer [2018-12-09 09:56:18,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:56:18,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:56:18,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:56:18,412 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:56:18,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:56:17" (1/3) ... [2018-12-09 09:56:18,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52767401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:56:18, skipping insertion in model container [2018-12-09 09:56:18,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:56:18" (2/3) ... [2018-12-09 09:56:18,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52767401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:56:18, skipping insertion in model container [2018-12-09 09:56:18,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:56:18" (3/3) ... [2018-12-09 09:56:18,414 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-12-09 09:56:18,420 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:56:18,424 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 09:56:18,432 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 09:56:18,449 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 09:56:18,449 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:56:18,449 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:56:18,450 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:56:18,450 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:56:18,450 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:56:18,450 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:56:18,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:56:18,450 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:56:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-12-09 09:56:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 09:56:18,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:18,465 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-12-09 09:56:18,466 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:18,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:18,469 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2018-12-09 09:56:18,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:18,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:18,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:18,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:18,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:56:18,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:18,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:18,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:18,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:18,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:18,598 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-12-09 09:56:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:18,649 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-12-09 09:56:18,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:18,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 09:56:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:18,658 INFO L225 Difference]: With dead ends: 377 [2018-12-09 09:56:18,658 INFO L226 Difference]: Without dead ends: 220 [2018-12-09 09:56:18,660 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-12-09 09:56:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-09 09:56:18,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-12-09 09:56:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-09 09:56:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-12-09 09:56:18,691 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2018-12-09 09:56:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:18,692 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-12-09 09:56:18,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-12-09 09:56:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 09:56:18,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:18,693 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-12-09 09:56:18,693 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:18,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:18,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2018-12-09 09:56:18,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:18,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:18,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:18,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:18,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:56:18,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:18,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:18,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:18,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:18,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:18,740 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-12-09 09:56:18,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:18,826 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2018-12-09 09:56:18,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:18,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-09 09:56:18,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:18,828 INFO L225 Difference]: With dead ends: 470 [2018-12-09 09:56:18,828 INFO L226 Difference]: Without dead ends: 262 [2018-12-09 09:56:18,828 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-12-09 09:56:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-09 09:56:18,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2018-12-09 09:56:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-09 09:56:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2018-12-09 09:56:18,837 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2018-12-09 09:56:18,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:18,837 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2018-12-09 09:56:18,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2018-12-09 09:56:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 09:56:18,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:18,839 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-12-09 09:56:18,839 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:18,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:18,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1578262845, now seen corresponding path program 1 times [2018-12-09 09:56:18,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:18,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:18,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:18,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:18,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 09:56:18,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:18,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:18,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:18,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:18,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:18,873 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2018-12-09 09:56:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:18,990 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-12-09 09:56:18,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:18,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-09 09:56:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:18,991 INFO L225 Difference]: With dead ends: 598 [2018-12-09 09:56:18,992 INFO L226 Difference]: Without dead ends: 354 [2018-12-09 09:56:18,993 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-12-09 09:56:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-09 09:56:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2018-12-09 09:56:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-12-09 09:56:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2018-12-09 09:56:19,007 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2018-12-09 09:56:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:19,007 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2018-12-09 09:56:19,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2018-12-09 09:56:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 09:56:19,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:19,010 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-12-09 09:56:19,010 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:19,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash -227175489, now seen corresponding path program 1 times [2018-12-09 09:56:19,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:19,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:19,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:19,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 09:56:19,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:19,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:19,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:19,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:19,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:19,053 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2018-12-09 09:56:19,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:19,141 INFO L93 Difference]: Finished difference Result 710 states and 1008 transitions. [2018-12-09 09:56:19,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:19,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-09 09:56:19,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:19,143 INFO L225 Difference]: With dead ends: 710 [2018-12-09 09:56:19,143 INFO L226 Difference]: Without dead ends: 386 [2018-12-09 09:56:19,143 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-12-09 09:56:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-09 09:56:19,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 374. [2018-12-09 09:56:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-12-09 09:56:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-12-09 09:56:19,151 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2018-12-09 09:56:19,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:19,152 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-12-09 09:56:19,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-12-09 09:56:19,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 09:56:19,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:19,153 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-12-09 09:56:19,154 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:19,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:19,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1103228957, now seen corresponding path program 1 times [2018-12-09 09:56:19,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:19,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 09:56:19,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:19,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:19,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:19,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:19,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:19,181 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-12-09 09:56:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:19,288 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2018-12-09 09:56:19,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:19,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-09 09:56:19,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:19,289 INFO L225 Difference]: With dead ends: 842 [2018-12-09 09:56:19,290 INFO L226 Difference]: Without dead ends: 478 [2018-12-09 09:56:19,290 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-12-09 09:56:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-12-09 09:56:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2018-12-09 09:56:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-12-09 09:56:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2018-12-09 09:56:19,299 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2018-12-09 09:56:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:19,299 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2018-12-09 09:56:19,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2018-12-09 09:56:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 09:56:19,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:19,301 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-12-09 09:56:19,301 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:19,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:19,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1629529054, now seen corresponding path program 1 times [2018-12-09 09:56:19,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:19,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:19,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:19,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 09:56:19,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:19,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:19,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:19,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:19,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:19,331 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2018-12-09 09:56:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:19,403 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2018-12-09 09:56:19,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:19,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-09 09:56:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:19,405 INFO L225 Difference]: With dead ends: 940 [2018-12-09 09:56:19,405 INFO L226 Difference]: Without dead ends: 500 [2018-12-09 09:56:19,406 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-12-09 09:56:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-12-09 09:56:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2018-12-09 09:56:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-12-09 09:56:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2018-12-09 09:56:19,422 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2018-12-09 09:56:19,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:19,422 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2018-12-09 09:56:19,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2018-12-09 09:56:19,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 09:56:19,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:19,424 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-12-09 09:56:19,424 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:19,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:19,425 INFO L82 PathProgramCache]: Analyzing trace with hash -233915046, now seen corresponding path program 1 times [2018-12-09 09:56:19,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:19,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:19,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:19,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 09:56:19,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:19,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:19,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:19,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:19,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:19,462 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2018-12-09 09:56:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:19,487 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2018-12-09 09:56:19,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:19,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-12-09 09:56:19,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:19,489 INFO L225 Difference]: With dead ends: 976 [2018-12-09 09:56:19,489 INFO L226 Difference]: Without dead ends: 734 [2018-12-09 09:56:19,490 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-12-09 09:56:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-12-09 09:56:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-12-09 09:56:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-12-09 09:56:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2018-12-09 09:56:19,502 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2018-12-09 09:56:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:19,502 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2018-12-09 09:56:19,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2018-12-09 09:56:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 09:56:19,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:19,516 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-12-09 09:56:19,516 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:19,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:19,516 INFO L82 PathProgramCache]: Analyzing trace with hash -674483159, now seen corresponding path program 1 times [2018-12-09 09:56:19,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:19,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-09 09:56:19,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:19,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:19,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:19,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:19,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:19,541 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2018-12-09 09:56:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:19,577 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2018-12-09 09:56:19,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:19,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-09 09:56:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:19,580 INFO L225 Difference]: With dead ends: 976 [2018-12-09 09:56:19,581 INFO L226 Difference]: Without dead ends: 974 [2018-12-09 09:56:19,581 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-12-09 09:56:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-12-09 09:56:19,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2018-12-09 09:56:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-12-09 09:56:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2018-12-09 09:56:19,600 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2018-12-09 09:56:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:19,600 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2018-12-09 09:56:19,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2018-12-09 09:56:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 09:56:19,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:19,602 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-12-09 09:56:19,602 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:19,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:19,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2095197958, now seen corresponding path program 1 times [2018-12-09 09:56:19,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:19,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:19,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:19,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-09 09:56:19,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:19,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:19,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:19,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:19,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:19,627 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2018-12-09 09:56:19,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:19,744 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2018-12-09 09:56:19,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:19,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-12-09 09:56:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:19,748 INFO L225 Difference]: With dead ends: 2140 [2018-12-09 09:56:19,748 INFO L226 Difference]: Without dead ends: 1170 [2018-12-09 09:56:19,750 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-12-09 09:56:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-12-09 09:56:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2018-12-09 09:56:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-12-09 09:56:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2018-12-09 09:56:19,775 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 139 [2018-12-09 09:56:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:19,775 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2018-12-09 09:56:19,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2018-12-09 09:56:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 09:56:19,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:19,778 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-12-09 09:56:19,778 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:19,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:19,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2111242741, now seen corresponding path program 1 times [2018-12-09 09:56:19,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:19,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:19,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:19,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-09 09:56:19,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:19,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:19,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:19,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:19,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:19,817 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2018-12-09 09:56:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:19,909 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2018-12-09 09:56:19,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:19,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-12-09 09:56:19,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:19,914 INFO L225 Difference]: With dead ends: 2354 [2018-12-09 09:56:19,914 INFO L226 Difference]: Without dead ends: 1236 [2018-12-09 09:56:19,916 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-12-09 09:56:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-12-09 09:56:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2018-12-09 09:56:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-12-09 09:56:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2018-12-09 09:56:19,943 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 175 [2018-12-09 09:56:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:19,943 INFO L480 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2018-12-09 09:56:19,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2018-12-09 09:56:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 09:56:19,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:19,945 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-12-09 09:56:19,945 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:19,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:19,946 INFO L82 PathProgramCache]: Analyzing trace with hash 834252520, now seen corresponding path program 1 times [2018-12-09 09:56:19,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:19,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:19,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:19,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-12-09 09:56:19,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:19,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:19,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:19,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:19,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:19,999 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2018-12-09 09:56:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:20,084 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2018-12-09 09:56:20,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:20,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2018-12-09 09:56:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:20,086 INFO L225 Difference]: With dead ends: 2544 [2018-12-09 09:56:20,087 INFO L226 Difference]: Without dead ends: 1334 [2018-12-09 09:56:20,088 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-12-09 09:56:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-12-09 09:56:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2018-12-09 09:56:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-12-09 09:56:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2018-12-09 09:56:20,105 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 196 [2018-12-09 09:56:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:20,105 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2018-12-09 09:56:20,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2018-12-09 09:56:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-09 09:56:20,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:20,107 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-12-09 09:56:20,107 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:20,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:20,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1654542421, now seen corresponding path program 1 times [2018-12-09 09:56:20,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:20,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:20,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:20,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:20,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-09 09:56:20,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:20,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:20,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:20,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:20,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:20,155 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2018-12-09 09:56:20,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:20,260 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2018-12-09 09:56:20,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:20,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-12-09 09:56:20,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:20,263 INFO L225 Difference]: With dead ends: 2752 [2018-12-09 09:56:20,263 INFO L226 Difference]: Without dead ends: 1442 [2018-12-09 09:56:20,265 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-12-09 09:56:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-12-09 09:56:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2018-12-09 09:56:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-12-09 09:56:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2018-12-09 09:56:20,286 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 220 [2018-12-09 09:56:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:20,286 INFO L480 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2018-12-09 09:56:20,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2018-12-09 09:56:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-09 09:56:20,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:20,288 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-12-09 09:56:20,289 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:20,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1609383977, now seen corresponding path program 1 times [2018-12-09 09:56:20,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:20,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:20,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:20,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:20,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-09 09:56:20,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:20,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:20,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:20,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:20,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:20,347 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2018-12-09 09:56:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:20,427 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2018-12-09 09:56:20,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:20,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-12-09 09:56:20,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:20,430 INFO L225 Difference]: With dead ends: 2992 [2018-12-09 09:56:20,430 INFO L226 Difference]: Without dead ends: 1570 [2018-12-09 09:56:20,432 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-12-09 09:56:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-12-09 09:56:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2018-12-09 09:56:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-12-09 09:56:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2018-12-09 09:56:20,450 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 220 [2018-12-09 09:56:20,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:20,450 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2018-12-09 09:56:20,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2018-12-09 09:56:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-09 09:56:20,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:20,453 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-12-09 09:56:20,453 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:20,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:20,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1500640469, now seen corresponding path program 1 times [2018-12-09 09:56:20,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:20,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:20,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:20,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:20,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-09 09:56:20,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:20,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:20,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:20,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:20,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:20,496 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2018-12-09 09:56:20,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:20,521 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2018-12-09 09:56:20,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:20,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-12-09 09:56:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:20,526 INFO L225 Difference]: With dead ends: 4646 [2018-12-09 09:56:20,526 INFO L226 Difference]: Without dead ends: 3100 [2018-12-09 09:56:20,528 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-12-09 09:56:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-12-09 09:56:20,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2018-12-09 09:56:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-12-09 09:56:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2018-12-09 09:56:20,563 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 250 [2018-12-09 09:56:20,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:20,563 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2018-12-09 09:56:20,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2018-12-09 09:56:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-09 09:56:20,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:20,566 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-12-09 09:56:20,566 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:20,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:20,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1763285929, now seen corresponding path program 1 times [2018-12-09 09:56:20,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:20,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:20,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:20,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:20,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-09 09:56:20,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:20,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:20,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:20,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:20,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:20,604 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2018-12-09 09:56:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:20,708 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2018-12-09 09:56:20,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:20,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-12-09 09:56:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:20,714 INFO L225 Difference]: With dead ends: 6484 [2018-12-09 09:56:20,714 INFO L226 Difference]: Without dead ends: 3398 [2018-12-09 09:56:20,717 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-12-09 09:56:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-12-09 09:56:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2018-12-09 09:56:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2018-12-09 09:56:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2018-12-09 09:56:20,753 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 250 [2018-12-09 09:56:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:20,753 INFO L480 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2018-12-09 09:56:20,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2018-12-09 09:56:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-12-09 09:56:20,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:20,757 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-12-09 09:56:20,757 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:20,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:20,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1165577599, now seen corresponding path program 1 times [2018-12-09 09:56:20,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:20,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:20,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:20,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:20,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2018-12-09 09:56:20,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:20,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:20,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:20,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:20,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:20,821 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2018-12-09 09:56:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:20,937 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2018-12-09 09:56:20,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:20,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2018-12-09 09:56:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:20,943 INFO L225 Difference]: With dead ends: 6900 [2018-12-09 09:56:20,943 INFO L226 Difference]: Without dead ends: 3530 [2018-12-09 09:56:20,947 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-12-09 09:56:20,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2018-12-09 09:56:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2018-12-09 09:56:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-12-09 09:56:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2018-12-09 09:56:20,990 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 274 [2018-12-09 09:56:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:20,990 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2018-12-09 09:56:20,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2018-12-09 09:56:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-09 09:56:20,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:20,994 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-12-09 09:56:20,995 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:20,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash -373875199, now seen corresponding path program 1 times [2018-12-09 09:56:20,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:20,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:20,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:20,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:20,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-12-09 09:56:21,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:21,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:21,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:21,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:21,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:21,037 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2018-12-09 09:56:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:21,166 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2018-12-09 09:56:21,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:21,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-12-09 09:56:21,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:21,173 INFO L225 Difference]: With dead ends: 7416 [2018-12-09 09:56:21,173 INFO L226 Difference]: Without dead ends: 3914 [2018-12-09 09:56:21,177 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-12-09 09:56:21,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2018-12-09 09:56:21,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2018-12-09 09:56:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-12-09 09:56:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2018-12-09 09:56:21,220 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 285 [2018-12-09 09:56:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:21,220 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2018-12-09 09:56:21,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2018-12-09 09:56:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-12-09 09:56:21,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:21,225 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-12-09 09:56:21,225 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:21,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:21,225 INFO L82 PathProgramCache]: Analyzing trace with hash -233584477, now seen corresponding path program 1 times [2018-12-09 09:56:21,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:21,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:21,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:21,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:21,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-12-09 09:56:21,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:21,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:21,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:21,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:21,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:21,283 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2018-12-09 09:56:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:21,413 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2018-12-09 09:56:21,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:21,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2018-12-09 09:56:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:21,424 INFO L225 Difference]: With dead ends: 8048 [2018-12-09 09:56:21,424 INFO L226 Difference]: Without dead ends: 4234 [2018-12-09 09:56:21,429 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-12-09 09:56:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2018-12-09 09:56:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2018-12-09 09:56:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-12-09 09:56:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2018-12-09 09:56:21,469 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 299 [2018-12-09 09:56:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:21,469 INFO L480 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2018-12-09 09:56:21,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2018-12-09 09:56:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-12-09 09:56:21,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:21,472 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-12-09 09:56:21,472 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:21,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:21,473 INFO L82 PathProgramCache]: Analyzing trace with hash -110745964, now seen corresponding path program 1 times [2018-12-09 09:56:21,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:21,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:21,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:21,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:21,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2018-12-09 09:56:21,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:21,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:21,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:21,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:21,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:21,560 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2018-12-09 09:56:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:21,606 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2018-12-09 09:56:21,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:21,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-12-09 09:56:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:21,614 INFO L225 Difference]: With dead ends: 11310 [2018-12-09 09:56:21,614 INFO L226 Difference]: Without dead ends: 7376 [2018-12-09 09:56:21,618 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-12-09 09:56:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2018-12-09 09:56:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2018-12-09 09:56:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2018-12-09 09:56:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2018-12-09 09:56:21,681 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 300 [2018-12-09 09:56:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:21,682 INFO L480 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2018-12-09 09:56:21,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2018-12-09 09:56:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-12-09 09:56:21,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:21,687 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-12-09 09:56:21,687 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:21,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash 123119806, now seen corresponding path program 1 times [2018-12-09 09:56:21,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:21,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:21,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:21,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2018-12-09 09:56:21,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:21,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:21,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:21,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:21,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:21,729 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2018-12-09 09:56:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:21,857 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2018-12-09 09:56:21,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:21,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2018-12-09 09:56:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:21,864 INFO L225 Difference]: With dead ends: 14744 [2018-12-09 09:56:21,864 INFO L226 Difference]: Without dead ends: 7382 [2018-12-09 09:56:21,869 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-12-09 09:56:21,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2018-12-09 09:56:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2018-12-09 09:56:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2018-12-09 09:56:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2018-12-09 09:56:21,931 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 301 [2018-12-09 09:56:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:21,932 INFO L480 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2018-12-09 09:56:21,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2018-12-09 09:56:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-12-09 09:56:21,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:21,936 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-12-09 09:56:21,936 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:21,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:21,936 INFO L82 PathProgramCache]: Analyzing trace with hash -994522767, now seen corresponding path program 1 times [2018-12-09 09:56:21,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:21,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:21,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:21,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:21,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 637 proven. 14 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-12-09 09:56:22,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:56:22,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/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-12-09 09:56:22,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:22,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:56:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2018-12-09 09:56:22,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:56:22,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-12-09 09:56:22,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:56:22,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:56:22,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:56:22,176 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 7 states. [2018-12-09 09:56:22,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:22,523 INFO L93 Difference]: Finished difference Result 18408 states and 23982 transitions. [2018-12-09 09:56:22,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:56:22,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 324 [2018-12-09 09:56:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:22,534 INFO L225 Difference]: With dead ends: 18408 [2018-12-09 09:56:22,534 INFO L226 Difference]: Without dead ends: 11034 [2018-12-09 09:56:22,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:56:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2018-12-09 09:56:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2018-12-09 09:56:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2018-12-09 09:56:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2018-12-09 09:56:22,666 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 324 [2018-12-09 09:56:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:22,667 INFO L480 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2018-12-09 09:56:22,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:56:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2018-12-09 09:56:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-12-09 09:56:22,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:22,672 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-12-09 09:56:22,672 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:22,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:22,673 INFO L82 PathProgramCache]: Analyzing trace with hash 233855425, now seen corresponding path program 1 times [2018-12-09 09:56:22,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:22,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:22,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 714 proven. 5 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2018-12-09 09:56:22,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:56:22,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/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-12-09 09:56:22,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:22,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:56:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2018-12-09 09:56:22,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:56:22,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-09 09:56:22,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:56:22,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:56:22,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:56:22,891 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 5 states. [2018-12-09 09:56:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:23,195 INFO L93 Difference]: Finished difference Result 18172 states and 23218 transitions. [2018-12-09 09:56:23,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:56:23,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 350 [2018-12-09 09:56:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:23,209 INFO L225 Difference]: With dead ends: 18172 [2018-12-09 09:56:23,209 INFO L226 Difference]: Without dead ends: 9722 [2018-12-09 09:56:23,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:56:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9722 states. [2018-12-09 09:56:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9722 to 7983. [2018-12-09 09:56:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7983 states. [2018-12-09 09:56:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 9971 transitions. [2018-12-09 09:56:23,327 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 9971 transitions. Word has length 350 [2018-12-09 09:56:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:23,328 INFO L480 AbstractCegarLoop]: Abstraction has 7983 states and 9971 transitions. [2018-12-09 09:56:23,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:56:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 9971 transitions. [2018-12-09 09:56:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-12-09 09:56:23,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:23,333 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-12-09 09:56:23,333 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:23,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:23,333 INFO L82 PathProgramCache]: Analyzing trace with hash 675475598, now seen corresponding path program 1 times [2018-12-09 09:56:23,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:23,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:23,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:23,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:23,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-12-09 09:56:23,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:56:23,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:56:23,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:56:23,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:56:23,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:56:23,405 INFO L87 Difference]: Start difference. First operand 7983 states and 9971 transitions. Second operand 3 states. [2018-12-09 09:56:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:23,587 INFO L93 Difference]: Finished difference Result 15357 states and 18836 transitions. [2018-12-09 09:56:23,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:56:23,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2018-12-09 09:56:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:23,591 INFO L225 Difference]: With dead ends: 15357 [2018-12-09 09:56:23,591 INFO L226 Difference]: Without dead ends: 3807 [2018-12-09 09:56:23,599 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-12-09 09:56:23,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2018-12-09 09:56:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 3549. [2018-12-09 09:56:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2018-12-09 09:56:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 4386 transitions. [2018-12-09 09:56:23,638 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 4386 transitions. Word has length 420 [2018-12-09 09:56:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:23,638 INFO L480 AbstractCegarLoop]: Abstraction has 3549 states and 4386 transitions. [2018-12-09 09:56:23,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:56:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4386 transitions. [2018-12-09 09:56:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-12-09 09:56:23,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:56:23,641 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-12-09 09:56:23,642 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:56:23,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:56:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash 331734252, now seen corresponding path program 1 times [2018-12-09 09:56:23,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:56:23,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:56:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:23,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:23,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:56:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-12-09 09:56:23,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:56:23,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/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-12-09 09:56:23,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:56:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:56:23,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:56:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-12-09 09:56:23,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:56:23,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-09 09:56:23,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:56:23,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:56:23,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:56:23,948 INFO L87 Difference]: Start difference. First operand 3549 states and 4386 transitions. Second operand 4 states. [2018-12-09 09:56:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:56:24,051 INFO L93 Difference]: Finished difference Result 4045 states and 5011 transitions. [2018-12-09 09:56:24,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:56:24,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 487 [2018-12-09 09:56:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:56:24,052 INFO L225 Difference]: With dead ends: 4045 [2018-12-09 09:56:24,052 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 09:56:24,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:56:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 09:56:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 09:56:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 09:56:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 09:56:24,056 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 487 [2018-12-09 09:56:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:56:24,057 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:56:24,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:56:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 09:56:24,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 09:56:24,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 09:56:24,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,404 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 390 DAG size of output: 100 [2018-12-09 09:56:24,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:24,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:56:25,117 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2018-12-09 09:56:25,136 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 09:56:25,136 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 09:56:25,136 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-12-09 09:56:25,136 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-12-09 09:56:25,136 INFO L451 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-12-09 09:56:25,137 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-12-09 09:56:25,137 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-12-09 09:56:25,137 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-12-09 09:56:25,137 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-12-09 09:56:25,137 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-12-09 09:56:25,137 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-12-09 09:56:25,137 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-12-09 09:56:25,137 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-12-09 09:56:25,137 INFO L448 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-12-09 09:56:25,137 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-12-09 09:56:25,137 INFO L448 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-12-09 09:56:25,137 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-12-09 09:56:25,137 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-12-09 09:56:25,138 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-12-09 09:56:25,138 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-12-09 09:56:25,138 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-12-09 09:56:25,138 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-12-09 09:56:25,138 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-12-09 09:56:25,138 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-12-09 09:56:25,138 INFO L448 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-12-09 09:56:25,138 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-12-09 09:56:25,138 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-12-09 09:56:25,138 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-12-09 09:56:25,138 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-12-09 09:56:25,138 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-12-09 09:56:25,138 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-12-09 09:56:25,139 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-12-09 09:56:25,139 INFO L448 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-12-09 09:56:25,139 INFO L448 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-12-09 09:56:25,139 INFO L451 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-12-09 09:56:25,139 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-12-09 09:56:25,139 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-12-09 09:56:25,139 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-12-09 09:56:25,139 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-12-09 09:56:25,139 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-12-09 09:56:25,139 INFO L448 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-12-09 09:56:25,139 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-12-09 09:56:25,139 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-12-09 09:56:25,139 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-12-09 09:56:25,139 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-12-09 09:56:25,139 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-12-09 09:56:25,140 INFO L448 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-12-09 09:56:25,140 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-12-09 09:56:25,140 INFO L448 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-12-09 09:56:25,140 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-12-09 09:56:25,140 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-12-09 09:56:25,140 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-12-09 09:56:25,140 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-12-09 09:56:25,140 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-12-09 09:56:25,140 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-12-09 09:56:25,140 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-12-09 09:56:25,140 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-12-09 09:56:25,140 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-12-09 09:56:25,140 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-12-09 09:56:25,140 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2018-12-09 09:56:25,141 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-12-09 09:56:25,141 INFO L448 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2018-12-09 09:56:25,141 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-12-09 09:56:25,141 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-12-09 09:56:25,141 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-12-09 09:56:25,141 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2018-12-09 09:56:25,141 INFO L448 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2018-12-09 09:56:25,141 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-12-09 09:56:25,141 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-12-09 09:56:25,141 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-12-09 09:56:25,141 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-12-09 09:56:25,141 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-12-09 09:56:25,141 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-12-09 09:56:25,142 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-12-09 09:56:25,142 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-12-09 09:56:25,142 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-12-09 09:56:25,142 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-12-09 09:56:25,142 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-12-09 09:56:25,142 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2018-12-09 09:56:25,142 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-12-09 09:56:25,142 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-12-09 09:56:25,142 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-12-09 09:56:25,142 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-12-09 09:56:25,142 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L444 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-12-09 09:56:25,143 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-12-09 09:56:25,144 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-12-09 09:56:25,144 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-12-09 09:56:25,144 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-12-09 09:56:25,144 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-12-09 09:56:25,144 INFO L448 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-12-09 09:56:25,144 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-12-09 09:56:25,144 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-12-09 09:56:25,144 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-12-09 09:56:25,144 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-12-09 09:56:25,144 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-12-09 09:56:25,144 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-12-09 09:56:25,144 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-12-09 09:56:25,144 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-12-09 09:56:25,144 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-12-09 09:56:25,145 INFO L448 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-12-09 09:56:25,145 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-12-09 09:56:25,145 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-12-09 09:56:25,145 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-12-09 09:56:25,145 INFO L448 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-12-09 09:56:25,145 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-12-09 09:56:25,145 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-12-09 09:56:25,145 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-12-09 09:56:25,145 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2018-12-09 09:56:25,145 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-12-09 09:56:25,145 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-12-09 09:56:25,145 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-12-09 09:56:25,145 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-09 09:56:25,146 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-12-09 09:56:25,146 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-12-09 09:56:25,146 INFO L448 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2018-12-09 09:56:25,146 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 09:56:25,146 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 09:56:25,146 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 09:56:25,146 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 09:56:25,146 INFO L444 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2018-12-09 09:56:25,146 INFO L448 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-12-09 09:56:25,146 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-12-09 09:56:25,146 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-12-09 09:56:25,146 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-12-09 09:56:25,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:56:25 BoogieIcfgContainer [2018-12-09 09:56:25,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:56:25,165 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:56:25,165 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:56:25,165 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:56:25,165 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:56:18" (3/4) ... [2018-12-09 09:56:25,168 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 09:56:25,174 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 09:56:25,174 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-12-09 09:56:25,174 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 09:56:25,181 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-09 09:56:25,182 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-09 09:56:25,182 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 09:56:25,201 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-12-09 09:56:25,201 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-12-09 09:56:25,201 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-12-09 09:56:25,201 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-12-09 09:56:25,201 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-12-09 09:56:25,202 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-12-09 09:56:25,202 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-12-09 09:56:25,202 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-12-09 09:56:25,202 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-12-09 09:56:25,202 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-12-09 09:56:25,202 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-12-09 09:56:25,203 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-12-09 09:56:25,203 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-12-09 09:56:25,203 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-12-09 09:56:25,203 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-12-09 09:56:25,203 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-12-09 09:56:25,204 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-12-09 09:56:25,240 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_14ba53bc-27b4-4525-b11a-5ec8788001e0/bin-2019/uautomizer/witness.graphml [2018-12-09 09:56:25,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:56:25,241 INFO L168 Benchmark]: Toolchain (without parser) took 7426.39 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 662.2 MB). Free memory was 958.7 MB in the beginning and 836.8 MB in the end (delta: 121.9 MB). Peak memory consumption was 784.1 MB. Max. memory is 11.5 GB. [2018-12-09 09:56:25,242 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:56:25,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 958.7 MB in the beginning and 1.1 GB in the end (delta: -134.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:56:25,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.08 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:56:25,242 INFO L168 Benchmark]: Boogie Preprocessor took 29.22 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:56:25,243 INFO L168 Benchmark]: RCFGBuilder took 318.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:56:25,243 INFO L168 Benchmark]: TraceAbstraction took 6753.90 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 565.7 MB). Free memory was 1.0 GB in the beginning and 853.8 MB in the end (delta: 186.5 MB). Peak memory consumption was 752.2 MB. Max. memory is 11.5 GB. [2018-12-09 09:56:25,243 INFO L168 Benchmark]: Witness Printer took 75.92 ms. Allocated memory is still 1.7 GB. Free memory was 853.8 MB in the beginning and 836.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-09 09:56:25,245 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 228.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 958.7 MB in the beginning and 1.1 GB in the end (delta: -134.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.08 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.22 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 318.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6753.90 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 565.7 MB). Free memory was 1.0 GB in the beginning and 853.8 MB in the end (delta: 186.5 MB). Peak memory consumption was 752.2 MB. Max. memory is 11.5 GB. * Witness Printer took 75.92 ms. Allocated memory is still 1.7 GB. Free memory was 853.8 MB in the beginning and 836.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. 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, 6.7s OverallTime, 24 OverallIterations, 18 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4880 SDtfs, 1922 SDslu, 3221 SDs, 0 SdLazy, 2713 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1248 GetRequests, 1209 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s 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: 0.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 5171 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 236 NumberOfFragments, 656 HoareAnnotationTreeSize, 26 FomulaSimplifications, 16403 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1648 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s 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...