./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_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_74e89605-dcae-4017-a434-c5b795818234/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/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 429b7772bb057004ca0c11ab7cd7751d4a0d846f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 15:10:19,861 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 15:10:19,862 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 15:10:19,868 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 15:10:19,868 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 15:10:19,869 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 15:10:19,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 15:10:19,871 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 15:10:19,871 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 15:10:19,872 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 15:10:19,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 15:10:19,873 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 15:10:19,873 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 15:10:19,874 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 15:10:19,874 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 15:10:19,875 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 15:10:19,875 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 15:10:19,876 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 15:10:19,877 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 15:10:19,878 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 15:10:19,878 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 15:10:19,879 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 15:10:19,880 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 15:10:19,880 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 15:10:19,880 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 15:10:19,881 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 15:10:19,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 15:10:19,882 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 15:10:19,882 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 15:10:19,883 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 15:10:19,883 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 15:10:19,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 15:10:19,884 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 15:10:19,884 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 15:10:19,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 15:10:19,885 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 15:10:19,885 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 15:10:19,892 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 15:10:19,892 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 15:10:19,893 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 15:10:19,893 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 15:10:19,893 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 15:10:19,893 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 15:10:19,894 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 15:10:19,894 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 15:10:19,894 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 15:10:19,894 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 15:10:19,894 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 15:10:19,894 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 15:10:19,894 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 15:10:19,894 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 15:10:19,895 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 15:10:19,895 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 15:10:19,895 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 15:10:19,895 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 15:10:19,895 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 15:10:19,895 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 15:10:19,895 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 15:10:19,895 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 15:10:19,896 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 15:10:19,896 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 15:10:19,896 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 15:10:19,896 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 15:10:19,896 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 15:10:19,896 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 15:10:19,896 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 15:10:19,896 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 15:10:19,897 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_74e89605-dcae-4017-a434-c5b795818234/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 -> 429b7772bb057004ca0c11ab7cd7751d4a0d846f [2018-12-01 15:10:19,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 15:10:19,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 15:10:19,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 15:10:19,924 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 15:10:19,924 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 15:10:19,925 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/bin-2019/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-12-01 15:10:19,958 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/bin-2019/uautomizer/data/28547aebc/0e2b411436394547b00a8ea94615c6d5/FLAGb128979a5 [2018-12-01 15:10:20,387 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 15:10:20,388 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-12-01 15:10:20,393 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/bin-2019/uautomizer/data/28547aebc/0e2b411436394547b00a8ea94615c6d5/FLAGb128979a5 [2018-12-01 15:10:20,402 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/bin-2019/uautomizer/data/28547aebc/0e2b411436394547b00a8ea94615c6d5 [2018-12-01 15:10:20,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 15:10:20,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 15:10:20,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 15:10:20,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 15:10:20,407 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 15:10:20,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:10:20" (1/1) ... [2018-12-01 15:10:20,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@650b367b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:10:20, skipping insertion in model container [2018-12-01 15:10:20,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:10:20" (1/1) ... [2018-12-01 15:10:20,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 15:10:20,431 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 15:10:20,546 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:10:20,548 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 15:10:20,578 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:10:20,616 INFO L195 MainTranslator]: Completed translation [2018-12-01 15:10:20,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:10:20 WrapperNode [2018-12-01 15:10:20,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 15:10:20,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 15:10:20,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 15:10:20,617 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 15:10:20,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:10:20" (1/1) ... [2018-12-01 15:10:20,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:10:20" (1/1) ... [2018-12-01 15:10:20,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 15:10:20,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 15:10:20,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 15:10:20,632 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 15:10:20,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:10:20" (1/1) ... [2018-12-01 15:10:20,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:10:20" (1/1) ... [2018-12-01 15:10:20,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:10:20" (1/1) ... [2018-12-01 15:10:20,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:10:20" (1/1) ... [2018-12-01 15:10:20,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:10:20" (1/1) ... [2018-12-01 15:10:20,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:10:20" (1/1) ... [2018-12-01 15:10:20,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:10:20" (1/1) ... [2018-12-01 15:10:20,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 15:10:20,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 15:10:20,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 15:10:20,656 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 15:10:20,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:10:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/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-01 15:10:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 15:10:20,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 15:10:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-01 15:10:20,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-01 15:10:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 15:10:20,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 15:10:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 15:10:20,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 15:10:20,764 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 15:10:20,764 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 15:10:20,978 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 15:10:20,978 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 15:10:20,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:10:20 BoogieIcfgContainer [2018-12-01 15:10:20,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 15:10:20,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 15:10:20,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 15:10:20,981 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 15:10:20,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:10:20" (1/3) ... [2018-12-01 15:10:20,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713a62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:10:20, skipping insertion in model container [2018-12-01 15:10:20,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:10:20" (2/3) ... [2018-12-01 15:10:20,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713a62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:10:20, skipping insertion in model container [2018-12-01 15:10:20,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:10:20" (3/3) ... [2018-12-01 15:10:20,983 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-12-01 15:10:20,989 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 15:10:20,994 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 15:10:21,004 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 15:10:21,022 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 15:10:21,023 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 15:10:21,023 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 15:10:21,023 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 15:10:21,023 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 15:10:21,023 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 15:10:21,023 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 15:10:21,023 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 15:10:21,023 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 15:10:21,036 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-12-01 15:10:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 15:10:21,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:21,040 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-01 15:10:21,042 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:21,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:21,045 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2018-12-01 15:10:21,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:21,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:21,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:21,164 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-01 15:10:21,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:21,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:21,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:21,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:21,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:21,177 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-12-01 15:10:21,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:21,241 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-12-01 15:10:21,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:21,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 15:10:21,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:21,250 INFO L225 Difference]: With dead ends: 377 [2018-12-01 15:10:21,250 INFO L226 Difference]: Without dead ends: 220 [2018-12-01 15:10:21,252 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-01 15:10:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-01 15:10:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-12-01 15:10:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-01 15:10:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-12-01 15:10:21,282 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2018-12-01 15:10:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:21,283 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-12-01 15:10:21,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-12-01 15:10:21,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-01 15:10:21,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:21,284 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-01 15:10:21,284 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:21,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2018-12-01 15:10:21,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:21,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:21,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:21,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:21,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:21,321 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-01 15:10:21,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:21,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:21,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:21,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:21,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:21,323 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-12-01 15:10:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:21,406 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2018-12-01 15:10:21,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:21,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-01 15:10:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:21,407 INFO L225 Difference]: With dead ends: 472 [2018-12-01 15:10:21,407 INFO L226 Difference]: Without dead ends: 264 [2018-12-01 15:10:21,408 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-01 15:10:21,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-01 15:10:21,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2018-12-01 15:10:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-01 15:10:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2018-12-01 15:10:21,420 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2018-12-01 15:10:21,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:21,420 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2018-12-01 15:10:21,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2018-12-01 15:10:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-01 15:10:21,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:21,421 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-01 15:10:21,422 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:21,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:21,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1571737336, now seen corresponding path program 1 times [2018-12-01 15:10:21,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:21,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:21,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:21,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:21,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:21,459 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-01 15:10:21,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:21,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:21,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:21,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:21,460 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2018-12-01 15:10:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:21,582 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-12-01 15:10:21,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:21,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-01 15:10:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:21,583 INFO L225 Difference]: With dead ends: 598 [2018-12-01 15:10:21,583 INFO L226 Difference]: Without dead ends: 354 [2018-12-01 15:10:21,584 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-01 15:10:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-01 15:10:21,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2018-12-01 15:10:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-12-01 15:10:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2018-12-01 15:10:21,596 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2018-12-01 15:10:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:21,597 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2018-12-01 15:10:21,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2018-12-01 15:10:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-01 15:10:21,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:21,599 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-01 15:10:21,599 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:21,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:21,600 INFO L82 PathProgramCache]: Analyzing trace with hash -233700998, now seen corresponding path program 1 times [2018-12-01 15:10:21,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:21,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:21,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:21,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:21,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:21,644 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-01 15:10:21,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:21,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:21,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:21,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:21,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:21,646 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2018-12-01 15:10:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:21,732 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2018-12-01 15:10:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:21,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-01 15:10:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:21,733 INFO L225 Difference]: With dead ends: 708 [2018-12-01 15:10:21,733 INFO L226 Difference]: Without dead ends: 384 [2018-12-01 15:10:21,734 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-01 15:10:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-12-01 15:10:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2018-12-01 15:10:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-12-01 15:10:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-12-01 15:10:21,742 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2018-12-01 15:10:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:21,742 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-12-01 15:10:21,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-12-01 15:10:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-01 15:10:21,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:21,744 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-01 15:10:21,744 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:21,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:21,744 INFO L82 PathProgramCache]: Analyzing trace with hash -343872958, now seen corresponding path program 1 times [2018-12-01 15:10:21,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:21,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:21,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:21,772 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-01 15:10:21,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:21,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:21,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:21,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:21,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:21,773 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-12-01 15:10:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:21,887 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2018-12-01 15:10:21,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:21,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-01 15:10:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:21,889 INFO L225 Difference]: With dead ends: 842 [2018-12-01 15:10:21,889 INFO L226 Difference]: Without dead ends: 478 [2018-12-01 15:10:21,890 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-01 15:10:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-12-01 15:10:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2018-12-01 15:10:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-12-01 15:10:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2018-12-01 15:10:21,899 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2018-12-01 15:10:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:21,899 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2018-12-01 15:10:21,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2018-12-01 15:10:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-01 15:10:21,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:21,900 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-01 15:10:21,901 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:21,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:21,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1570407527, now seen corresponding path program 1 times [2018-12-01 15:10:21,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:21,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:21,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:21,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:21,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:21,926 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-01 15:10:21,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:21,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:21,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:21,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:21,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:21,927 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2018-12-01 15:10:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:22,024 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2018-12-01 15:10:22,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:22,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-01 15:10:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:22,026 INFO L225 Difference]: With dead ends: 940 [2018-12-01 15:10:22,027 INFO L226 Difference]: Without dead ends: 500 [2018-12-01 15:10:22,028 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-01 15:10:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-12-01 15:10:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2018-12-01 15:10:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-12-01 15:10:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2018-12-01 15:10:22,041 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2018-12-01 15:10:22,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:22,042 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2018-12-01 15:10:22,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2018-12-01 15:10:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-01 15:10:22,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:22,044 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-01 15:10:22,044 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:22,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:22,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1356861727, now seen corresponding path program 1 times [2018-12-01 15:10:22,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:22,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:22,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:22,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:22,085 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-01 15:10:22,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:22,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:22,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:22,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:22,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:22,086 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2018-12-01 15:10:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:22,124 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2018-12-01 15:10:22,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:22,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-12-01 15:10:22,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:22,126 INFO L225 Difference]: With dead ends: 976 [2018-12-01 15:10:22,126 INFO L226 Difference]: Without dead ends: 734 [2018-12-01 15:10:22,126 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-01 15:10:22,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-12-01 15:10:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-12-01 15:10:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-12-01 15:10:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2018-12-01 15:10:22,138 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2018-12-01 15:10:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:22,139 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2018-12-01 15:10:22,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2018-12-01 15:10:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-01 15:10:22,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:22,140 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-01 15:10:22,140 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:22,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:22,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1774863991, now seen corresponding path program 1 times [2018-12-01 15:10:22,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:22,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:22,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:22,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:22,183 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-01 15:10:22,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:22,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:22,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:22,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:22,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:22,184 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2018-12-01 15:10:22,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:22,216 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2018-12-01 15:10:22,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:22,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-01 15:10:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:22,219 INFO L225 Difference]: With dead ends: 976 [2018-12-01 15:10:22,219 INFO L226 Difference]: Without dead ends: 974 [2018-12-01 15:10:22,220 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-01 15:10:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-12-01 15:10:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2018-12-01 15:10:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-12-01 15:10:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2018-12-01 15:10:22,241 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2018-12-01 15:10:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:22,241 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2018-12-01 15:10:22,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2018-12-01 15:10:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-01 15:10:22,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:22,244 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:22,244 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:22,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:22,244 INFO L82 PathProgramCache]: Analyzing trace with hash 600728947, now seen corresponding path program 1 times [2018-12-01 15:10:22,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:22,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:22,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:22,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-01 15:10:22,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:22,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:22,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:22,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:22,288 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2018-12-01 15:10:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:22,403 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2018-12-01 15:10:22,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:22,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-12-01 15:10:22,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:22,405 INFO L225 Difference]: With dead ends: 2140 [2018-12-01 15:10:22,405 INFO L226 Difference]: Without dead ends: 1170 [2018-12-01 15:10:22,407 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-01 15:10:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-12-01 15:10:22,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2018-12-01 15:10:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-12-01 15:10:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2018-12-01 15:10:22,422 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 154 [2018-12-01 15:10:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:22,422 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2018-12-01 15:10:22,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2018-12-01 15:10:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-01 15:10:22,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:22,424 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:22,424 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:22,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:22,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1176011842, now seen corresponding path program 1 times [2018-12-01 15:10:22,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:22,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:22,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:22,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-12-01 15:10:22,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:22,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:22,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:22,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:22,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:22,461 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2018-12-01 15:10:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:22,545 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2018-12-01 15:10:22,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:22,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-12-01 15:10:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:22,549 INFO L225 Difference]: With dead ends: 2354 [2018-12-01 15:10:22,549 INFO L226 Difference]: Without dead ends: 1236 [2018-12-01 15:10:22,551 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-01 15:10:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-12-01 15:10:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2018-12-01 15:10:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-12-01 15:10:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2018-12-01 15:10:22,568 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 190 [2018-12-01 15:10:22,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:22,568 INFO L480 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2018-12-01 15:10:22,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2018-12-01 15:10:22,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-01 15:10:22,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:22,571 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:22,571 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:22,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:22,571 INFO L82 PathProgramCache]: Analyzing trace with hash -717257595, now seen corresponding path program 1 times [2018-12-01 15:10:22,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:22,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:22,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:22,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-12-01 15:10:22,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:22,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:22,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:22,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:22,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:22,612 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2018-12-01 15:10:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:22,701 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2018-12-01 15:10:22,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:22,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-12-01 15:10:22,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:22,705 INFO L225 Difference]: With dead ends: 2544 [2018-12-01 15:10:22,706 INFO L226 Difference]: Without dead ends: 1334 [2018-12-01 15:10:22,707 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-01 15:10:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-12-01 15:10:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2018-12-01 15:10:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-12-01 15:10:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2018-12-01 15:10:22,735 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 211 [2018-12-01 15:10:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:22,736 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2018-12-01 15:10:22,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2018-12-01 15:10:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-01 15:10:22,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:22,740 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:22,740 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:22,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:22,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1079909240, now seen corresponding path program 1 times [2018-12-01 15:10:22,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:22,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:22,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:22,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-01 15:10:22,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:22,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:22,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:22,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:22,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:22,813 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2018-12-01 15:10:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:22,915 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2018-12-01 15:10:22,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:22,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-12-01 15:10:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:22,918 INFO L225 Difference]: With dead ends: 2752 [2018-12-01 15:10:22,919 INFO L226 Difference]: Without dead ends: 1442 [2018-12-01 15:10:22,920 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-01 15:10:22,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-12-01 15:10:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2018-12-01 15:10:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-12-01 15:10:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2018-12-01 15:10:22,954 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 235 [2018-12-01 15:10:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:22,954 INFO L480 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2018-12-01 15:10:22,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2018-12-01 15:10:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-01 15:10:22,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:22,958 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:22,959 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:22,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:22,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1213171786, now seen corresponding path program 1 times [2018-12-01 15:10:22,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:22,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:22,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:22,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-01 15:10:22,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:22,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:22,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:22,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:22,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:22,997 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2018-12-01 15:10:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:23,089 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2018-12-01 15:10:23,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:23,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-12-01 15:10:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:23,092 INFO L225 Difference]: With dead ends: 2992 [2018-12-01 15:10:23,092 INFO L226 Difference]: Without dead ends: 1570 [2018-12-01 15:10:23,094 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-01 15:10:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-12-01 15:10:23,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2018-12-01 15:10:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-12-01 15:10:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2018-12-01 15:10:23,113 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 235 [2018-12-01 15:10:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:23,113 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2018-12-01 15:10:23,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:23,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2018-12-01 15:10:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-01 15:10:23,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:23,116 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:23,116 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:23,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:23,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1569112328, now seen corresponding path program 1 times [2018-12-01 15:10:23,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:23,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:23,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:23,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:23,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-12-01 15:10:23,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:23,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:23,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:23,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:23,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:23,157 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2018-12-01 15:10:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:23,195 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2018-12-01 15:10:23,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:23,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-12-01 15:10:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:23,204 INFO L225 Difference]: With dead ends: 4646 [2018-12-01 15:10:23,204 INFO L226 Difference]: Without dead ends: 3100 [2018-12-01 15:10:23,207 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-01 15:10:23,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-12-01 15:10:23,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2018-12-01 15:10:23,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-12-01 15:10:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2018-12-01 15:10:23,257 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 265 [2018-12-01 15:10:23,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:23,257 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2018-12-01 15:10:23,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2018-12-01 15:10:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-01 15:10:23,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:23,261 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:23,261 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:23,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:23,261 INFO L82 PathProgramCache]: Analyzing trace with hash 432773942, now seen corresponding path program 1 times [2018-12-01 15:10:23,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:23,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:23,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:23,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:23,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-12-01 15:10:23,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:23,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:23,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:23,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:23,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:23,304 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2018-12-01 15:10:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:23,421 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2018-12-01 15:10:23,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:23,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-12-01 15:10:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:23,427 INFO L225 Difference]: With dead ends: 6484 [2018-12-01 15:10:23,427 INFO L226 Difference]: Without dead ends: 3398 [2018-12-01 15:10:23,430 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-01 15:10:23,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-12-01 15:10:23,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2018-12-01 15:10:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2018-12-01 15:10:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2018-12-01 15:10:23,471 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 265 [2018-12-01 15:10:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:23,472 INFO L480 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2018-12-01 15:10:23,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2018-12-01 15:10:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-12-01 15:10:23,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:23,477 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:23,477 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:23,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:23,477 INFO L82 PathProgramCache]: Analyzing trace with hash -764797682, now seen corresponding path program 1 times [2018-12-01 15:10:23,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:23,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:23,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2018-12-01 15:10:23,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:23,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:23,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:23,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:23,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:23,557 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2018-12-01 15:10:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:23,671 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2018-12-01 15:10:23,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:23,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2018-12-01 15:10:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:23,678 INFO L225 Difference]: With dead ends: 6900 [2018-12-01 15:10:23,678 INFO L226 Difference]: Without dead ends: 3530 [2018-12-01 15:10:23,682 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-01 15:10:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2018-12-01 15:10:23,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2018-12-01 15:10:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-12-01 15:10:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2018-12-01 15:10:23,721 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 289 [2018-12-01 15:10:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:23,722 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2018-12-01 15:10:23,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2018-12-01 15:10:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-12-01 15:10:23,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:23,727 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:23,727 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:23,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:23,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2053251468, now seen corresponding path program 1 times [2018-12-01 15:10:23,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:23,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:23,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:23,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:23,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-12-01 15:10:23,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:23,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:23,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:23,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:23,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:23,773 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2018-12-01 15:10:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:23,915 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2018-12-01 15:10:23,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:23,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-12-01 15:10:23,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:23,925 INFO L225 Difference]: With dead ends: 7416 [2018-12-01 15:10:23,925 INFO L226 Difference]: Without dead ends: 3914 [2018-12-01 15:10:23,930 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-01 15:10:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2018-12-01 15:10:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2018-12-01 15:10:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-12-01 15:10:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2018-12-01 15:10:23,971 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 300 [2018-12-01 15:10:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:23,972 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2018-12-01 15:10:23,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2018-12-01 15:10:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-12-01 15:10:23,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:23,976 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:23,976 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:23,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash 816481962, now seen corresponding path program 1 times [2018-12-01 15:10:23,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:23,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:23,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2018-12-01 15:10:24,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:24,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:24,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:24,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:24,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:24,026 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2018-12-01 15:10:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:24,143 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2018-12-01 15:10:24,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:24,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-12-01 15:10:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:24,151 INFO L225 Difference]: With dead ends: 8048 [2018-12-01 15:10:24,151 INFO L226 Difference]: Without dead ends: 4234 [2018-12-01 15:10:24,154 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-01 15:10:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2018-12-01 15:10:24,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2018-12-01 15:10:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-12-01 15:10:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2018-12-01 15:10:24,191 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 314 [2018-12-01 15:10:24,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:24,192 INFO L480 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2018-12-01 15:10:24,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:24,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2018-12-01 15:10:24,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-12-01 15:10:24,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:24,196 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:24,196 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:24,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:24,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1006853977, now seen corresponding path program 1 times [2018-12-01 15:10:24,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:24,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:24,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:24,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:24,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 707 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-12-01 15:10:24,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:24,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:24,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:24,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:24,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:24,285 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2018-12-01 15:10:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:24,334 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2018-12-01 15:10:24,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:24,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2018-12-01 15:10:24,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:24,344 INFO L225 Difference]: With dead ends: 11310 [2018-12-01 15:10:24,344 INFO L226 Difference]: Without dead ends: 7376 [2018-12-01 15:10:24,348 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-01 15:10:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2018-12-01 15:10:24,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2018-12-01 15:10:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2018-12-01 15:10:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2018-12-01 15:10:24,411 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 315 [2018-12-01 15:10:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:24,411 INFO L480 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2018-12-01 15:10:24,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2018-12-01 15:10:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-12-01 15:10:24,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:24,417 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:24,417 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:24,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:24,417 INFO L82 PathProgramCache]: Analyzing trace with hash 999089455, now seen corresponding path program 1 times [2018-12-01 15:10:24,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:24,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:24,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:24,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:24,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-12-01 15:10:24,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:24,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:24,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:24,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:24,484 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2018-12-01 15:10:24,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:24,608 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2018-12-01 15:10:24,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:24,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2018-12-01 15:10:24,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:24,616 INFO L225 Difference]: With dead ends: 14744 [2018-12-01 15:10:24,616 INFO L226 Difference]: Without dead ends: 7382 [2018-12-01 15:10:24,622 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-01 15:10:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2018-12-01 15:10:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2018-12-01 15:10:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2018-12-01 15:10:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2018-12-01 15:10:24,703 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 316 [2018-12-01 15:10:24,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:24,704 INFO L480 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2018-12-01 15:10:24,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2018-12-01 15:10:24,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-12-01 15:10:24,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:24,710 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:24,710 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:24,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:24,710 INFO L82 PathProgramCache]: Analyzing trace with hash -901585188, now seen corresponding path program 1 times [2018-12-01 15:10:24,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:24,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:24,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:24,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:24,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 766 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-12-01 15:10:24,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:10:24,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/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-01 15:10:24,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:24,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:10:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2018-12-01 15:10:24,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:10:24,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-12-01 15:10:24,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:10:24,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:10:24,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:10:24,999 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 7 states. [2018-12-01 15:10:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:25,402 INFO L93 Difference]: Finished difference Result 18408 states and 23982 transitions. [2018-12-01 15:10:25,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:10:25,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 339 [2018-12-01 15:10:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:25,414 INFO L225 Difference]: With dead ends: 18408 [2018-12-01 15:10:25,414 INFO L226 Difference]: Without dead ends: 11034 [2018-12-01 15:10:25,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-01 15:10:25,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2018-12-01 15:10:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2018-12-01 15:10:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2018-12-01 15:10:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2018-12-01 15:10:25,551 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 339 [2018-12-01 15:10:25,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:25,552 INFO L480 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2018-12-01 15:10:25,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:10:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2018-12-01 15:10:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-12-01 15:10:25,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:25,559 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:25,559 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:25,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:25,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2002133556, now seen corresponding path program 1 times [2018-12-01 15:10:25,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:25,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:25,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-12-01 15:10:25,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:10:25,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/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-01 15:10:25,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:25,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:10:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-01 15:10:25,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:10:25,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-01 15:10:25,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:10:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:10:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:10:25,770 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 5 states. [2018-12-01 15:10:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:26,116 INFO L93 Difference]: Finished difference Result 18174 states and 23220 transitions. [2018-12-01 15:10:26,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:10:26,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 365 [2018-12-01 15:10:26,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:26,126 INFO L225 Difference]: With dead ends: 18174 [2018-12-01 15:10:26,126 INFO L226 Difference]: Without dead ends: 9724 [2018-12-01 15:10:26,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:10:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9724 states. [2018-12-01 15:10:26,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9724 to 7985. [2018-12-01 15:10:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7985 states. [2018-12-01 15:10:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7985 states to 7985 states and 9973 transitions. [2018-12-01 15:10:26,229 INFO L78 Accepts]: Start accepts. Automaton has 7985 states and 9973 transitions. Word has length 365 [2018-12-01 15:10:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:26,229 INFO L480 AbstractCegarLoop]: Abstraction has 7985 states and 9973 transitions. [2018-12-01 15:10:26,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:10:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 7985 states and 9973 transitions. [2018-12-01 15:10:26,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-12-01 15:10:26,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:26,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 15:10:26,236 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:26,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:26,236 INFO L82 PathProgramCache]: Analyzing trace with hash -885260259, now seen corresponding path program 1 times [2018-12-01 15:10:26,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:26,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:26,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:26,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:26,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-12-01 15:10:26,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:10:26,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:10:26,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:10:26,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:10:26,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:10:26,329 INFO L87 Difference]: Start difference. First operand 7985 states and 9973 transitions. Second operand 3 states. [2018-12-01 15:10:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:26,532 INFO L93 Difference]: Finished difference Result 15351 states and 18826 transitions. [2018-12-01 15:10:26,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:10:26,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2018-12-01 15:10:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:26,536 INFO L225 Difference]: With dead ends: 15351 [2018-12-01 15:10:26,537 INFO L226 Difference]: Without dead ends: 3759 [2018-12-01 15:10:26,546 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-01 15:10:26,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2018-12-01 15:10:26,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3524. [2018-12-01 15:10:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2018-12-01 15:10:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4353 transitions. [2018-12-01 15:10:26,593 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4353 transitions. Word has length 418 [2018-12-01 15:10:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:26,594 INFO L480 AbstractCegarLoop]: Abstraction has 3524 states and 4353 transitions. [2018-12-01 15:10:26,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:10:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4353 transitions. [2018-12-01 15:10:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-12-01 15:10:26,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:10:26,598 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:10:26,599 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:10:26,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:10:26,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1596843861, now seen corresponding path program 1 times [2018-12-01 15:10:26,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:10:26,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:10:26,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:26,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:26,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:10:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2018-12-01 15:10:26,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:10:26,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/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-01 15:10:26,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:10:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:10:26,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:10:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2018-12-01 15:10:26,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:10:26,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-01 15:10:26,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:10:26,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:10:26,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:10:26,999 INFO L87 Difference]: Start difference. First operand 3524 states and 4353 transitions. Second operand 5 states. [2018-12-01 15:10:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:10:27,118 INFO L93 Difference]: Finished difference Result 4022 states and 4980 transitions. [2018-12-01 15:10:27,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:10:27,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 502 [2018-12-01 15:10:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:10:27,119 INFO L225 Difference]: With dead ends: 4022 [2018-12-01 15:10:27,119 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 15:10:27,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:10:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 15:10:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 15:10:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 15:10:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 15:10:27,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 502 [2018-12-01 15:10:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:10:27,124 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 15:10:27,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:10:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 15:10:27,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 15:10:27,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-01 15:10:27,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 15:10:27,444 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 104 [2018-12-01 15:10:28,176 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2018-12-01 15:10:28,179 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-01 15:10:28,179 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-01 15:10:28,179 INFO L451 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2018-12-01 15:10:28,179 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2018-12-01 15:10:28,179 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2018-12-01 15:10:28,179 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2018-12-01 15:10:28,179 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2018-12-01 15:10:28,179 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 515) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 (not .cse1)))) [2018-12-01 15:10:28,179 INFO L444 ceAbstractionStarter]: At program point L136(lines 132 537) 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-01 15:10:28,179 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2018-12-01 15:10:28,179 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2018-12-01 15:10:28,179 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2018-12-01 15:10:28,179 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2018-12-01 15:10:28,180 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2018-12-01 15:10:28,180 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2018-12-01 15:10:28,180 INFO L448 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2018-12-01 15:10:28,180 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2018-12-01 15:10:28,180 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-12-01 15:10:28,180 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2018-12-01 15:10:28,180 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2018-12-01 15:10:28,180 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2018-12-01 15:10:28,180 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2018-12-01 15:10:28,180 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2018-12-01 15:10:28,180 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 513) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2018-12-01 15:10:28,181 INFO L444 ceAbstractionStarter]: At program point L172(lines 162 527) 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-01 15:10:28,181 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2018-12-01 15:10:28,181 INFO L448 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2018-12-01 15:10:28,181 INFO L448 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2018-12-01 15:10:28,181 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-12-01 15:10:28,181 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2018-12-01 15:10:28,181 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2018-12-01 15:10:28,181 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2018-12-01 15:10:28,181 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 85 575) no Hoare annotation was computed. [2018-12-01 15:10:28,181 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2018-12-01 15:10:28,181 INFO L451 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2018-12-01 15:10:28,181 INFO L444 ceAbstractionStarter]: At program point L142(lines 138 535) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-12-01 15:10:28,181 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-01 15:10:28,182 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2018-12-01 15:10:28,182 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2018-12-01 15:10:28,182 INFO L451 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2018-12-01 15:10:28,182 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2018-12-01 15:10:28,182 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2018-12-01 15:10:28,182 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2018-12-01 15:10:28,182 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2018-12-01 15:10:28,182 INFO L448 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2018-12-01 15:10:28,182 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 523) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |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-01 15:10:28,182 INFO L444 ceAbstractionStarter]: At program point L112(lines 111 544) 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-01 15:10:28,182 INFO L448 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2018-12-01 15:10:28,183 INFO L444 ceAbstractionStarter]: At program point L510(lines 108 563) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse6 (= ssl3_connect_~s__state~0 4448)) (.cse10 (not .cse1)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse13 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse14 (= ssl3_connect_~s__state~0 4464)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse7 (<= ssl3_connect_~blastFlag~0 2)) (.cse15 (= ssl3_connect_~s__state~0 4400))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse0 .cse1) (and .cse3 .cse6 .cse1) (and .cse7 .cse8 .cse9 .cse10) (and .cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11 .cse12 .cse10) (and .cse5 .cse0 .cse1) (and .cse13 .cse7 .cse1) (and .cse14 .cse0 .cse1) (and .cse3 .cse15 .cse0 .cse1) (and .cse7 .cse5) (and .cse3 .cse16 .cse1) (and .cse3 .cse8 .cse1 .cse9 .cse17) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse13 .cse3) (and .cse3 .cse1 .cse2) (and .cse7 .cse16) (and .cse14 .cse3 .cse1) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse7 (= ssl3_connect_~s__state~0 4384)) (and (= ssl3_connect_~s__state~0 4416) .cse0 .cse1) (and .cse16 .cse0 .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and .cse3 .cse11 .cse12 .cse1 .cse17) (and .cse4 .cse0 .cse1) (and .cse7 .cse15 .cse1)))) [2018-12-01 15:10:28,183 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2018-12-01 15:10:28,183 INFO L444 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-12-01 15:10:28,183 INFO L448 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2018-12-01 15:10:28,183 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2018-12-01 15:10:28,183 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2018-12-01 15:10:28,183 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2018-12-01 15:10:28,183 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2018-12-01 15:10:28,183 INFO L444 ceAbstractionStarter]: At program point L148(lines 144 533) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-12-01 15:10:28,183 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2018-12-01 15:10:28,183 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2018-12-01 15:10:28,183 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2018-12-01 15:10:28,183 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-12-01 15:10:28,183 INFO L448 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2018-12-01 15:10:28,183 INFO L448 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2018-12-01 15:10:28,184 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2018-12-01 15:10:28,184 INFO L444 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0)) [2018-12-01 15:10:28,184 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2018-12-01 15:10:28,184 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2018-12-01 15:10:28,184 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2018-12-01 15:10:28,184 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 576) the Hoare annotation is: true [2018-12-01 15:10:28,184 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2018-12-01 15:10:28,184 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2018-12-01 15:10:28,184 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 521) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |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-01 15:10:28,184 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-12-01 15:10:28,184 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-12-01 15:10:28,184 INFO L448 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2018-12-01 15:10:28,184 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2018-12-01 15:10:28,184 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2018-12-01 15:10:28,184 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L444 ceAbstractionStarter]: At program point L154(lines 150 531) 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-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 211 511) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 211 511) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 519) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |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-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2018-12-01 15:10:28,185 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 576) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 576) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L444 ceAbstractionStarter]: At program point L160(lines 156 529) 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-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2018-12-01 15:10:28,186 INFO L448 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2018-12-01 15:10:28,187 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2018-12-01 15:10:28,187 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2018-12-01 15:10:28,187 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2018-12-01 15:10:28,187 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2018-12-01 15:10:28,187 INFO L448 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2018-12-01 15:10:28,187 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 517) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |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-01 15:10:28,187 INFO L444 ceAbstractionStarter]: At program point L130(lines 126 539) 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-01 15:10:28,187 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2018-12-01 15:10:28,187 INFO L448 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2018-12-01 15:10:28,187 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2018-12-01 15:10:28,187 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2018-12-01 15:10:28,188 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2018-12-01 15:10:28,188 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2018-12-01 15:10:28,188 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2018-12-01 15:10:28,188 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2018-12-01 15:10:28,188 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2018-12-01 15:10:28,188 INFO L448 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2018-12-01 15:10:28,188 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2018-12-01 15:10:28,188 INFO L448 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2018-12-01 15:10:28,188 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-01 15:10:28,188 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-01 15:10:28,188 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-01 15:10:28,188 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-01 15:10:28,188 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 577 587) the Hoare annotation is: true [2018-12-01 15:10:28,188 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 577 587) no Hoare annotation was computed. [2018-12-01 15:10:28,188 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 577 587) no Hoare annotation was computed. [2018-12-01 15:10:28,188 INFO L444 ceAbstractionStarter]: At program point L583(line 583) the Hoare annotation is: (<= 12292 main_~s~0) [2018-12-01 15:10:28,188 INFO L448 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2018-12-01 15:10:28,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:10:28 BoogieIcfgContainer [2018-12-01 15:10:28,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 15:10:28,207 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 15:10:28,207 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 15:10:28,208 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 15:10:28,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:10:20" (3/4) ... [2018-12-01 15:10:28,211 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 15:10:28,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 15:10:28,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-12-01 15:10:28,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 15:10:28,225 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-01 15:10:28,225 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-01 15:10:28,226 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 15:10:28,246 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-12-01 15:10:28,246 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-12-01 15:10:28,246 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-01 15:10:28,246 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-12-01 15:10:28,247 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-12-01 15:10:28,247 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-01 15:10:28,247 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-01 15:10:28,247 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)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && 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)) || ((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-01 15:10:28,247 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-01 15:10:28,247 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-12-01 15:10:28,248 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-01 15:10:28,248 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-01 15:10:28,248 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-01 15:10:28,248 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-01 15:10:28,249 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-01 15:10:28,249 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) [2018-12-01 15:10:28,249 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) && !(s__hit == 0)) [2018-12-01 15:10:28,296 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_74e89605-dcae-4017-a434-c5b795818234/bin-2019/uautomizer/witness.graphml [2018-12-01 15:10:28,296 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 15:10:28,296 INFO L168 Benchmark]: Toolchain (without parser) took 7892.41 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 850.4 MB). Free memory was 954.4 MB in the beginning and 1.5 GB in the end (delta: -558.2 MB). Peak memory consumption was 292.2 MB. Max. memory is 11.5 GB. [2018-12-01 15:10:28,297 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:10:28,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-12-01 15:10:28,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:10:28,297 INFO L168 Benchmark]: Boogie Preprocessor took 23.64 ms. Allocated memory is still 1.2 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-01 15:10:28,297 INFO L168 Benchmark]: RCFGBuilder took 322.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2018-12-01 15:10:28,298 INFO L168 Benchmark]: TraceAbstraction took 7228.42 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 714.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -431.8 MB). Peak memory consumption was 815.7 MB. Max. memory is 11.5 GB. [2018-12-01 15:10:28,298 INFO L168 Benchmark]: Witness Printer took 88.48 ms. Allocated memory is still 1.9 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:10:28,299 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 211.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.64 ms. Allocated memory is still 1.2 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 322.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7228.42 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 714.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -431.8 MB). Peak memory consumption was 815.7 MB. Max. memory is 11.5 GB. * Witness Printer took 88.48 ms. Allocated memory is still 1.9 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 573]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (\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: 198]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (\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: 85]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((\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: 204]: 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) && !(s__hit == 0)) - InvariantResult [Line: 126]: 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: 114]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || blastFlag <= 0 - InvariantResult [Line: 180]: 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: 111]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && 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)) || ((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: 186]: 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: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 174]: 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: 209]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 138 locations, 1 error locations. SAFE Result, 7.1s OverallTime, 24 OverallIterations, 19 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4900 SDtfs, 1943 SDslu, 3317 SDs, 0 SdLazy, 2728 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1295 GetRequests, 1254 SyntacticMatches, 0 SemanticMatches, 41 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, 5148 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 240 NumberOfFragments, 701 HoareAnnotationTreeSize, 26 FomulaSimplifications, 16624 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1670 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 6457 NumberOfCodeBlocks, 6457 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6430 ConstructedInterpolants, 0 QuantifiedInterpolants, 3029160 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2261 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 23929/23960 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...